Results 81 to 90 of about 51,530 (240)

Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems

Information
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari, Mahdi Zeinalabedinmalekmian, Hossein Azgomi, Mahmoud Alimoradi, Shirin Ghaziantafrishi   +4 more
doaj   +1 more source

Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem

Entropy, 2020
The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previous ...
Petr Stodola, Karel Michenka, Jan Nohel, Marian Rybanský   +3 more
doaj   +1 more source

Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley   +1 more source

A study on exponential-size neighborhoods for the bin packing problem with conflicts

, 2017
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha, Frota, Yuri, Ochi, Luiz Satoru, Vidal, Thibaut   +3 more
core   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

Networks, EarlyView.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz, Ernestine Großmann, Christian Schulz   +2 more
wiley   +1 more source

ACO for continuous function optimization: a performance analysis [PDF]

, 2014
The performance of the meta-heuristic algorithms often depends on their parameter settings. Appropriate tuning of the underlying parameters can drastically improve the performance of a meta-heuristic. The Ant Colony Optimization (ACO), a population based
Abraham, Ajith, Ojha, Varun Kumar, Snášel, Václav   +2 more
core  

The Integration of AI, Blockchain and IoT for the Sustainable Development of the Logistics Service Industry: Insights From a PRISMA‐Based Analysis

Sustainable Development, EarlyView.
ABSTRACT This study presents an analysis of the literature on artificial intelligence (AI), blockchain and internet of things (IoT) for the sustainable development of the service industry of freight transport and logistics service providers (LSPs).
Roberto Cerchione, Renato Passaro, Matteo Tavano   +2 more
wiley   +1 more source

High Sensitivity Cardiac Troponin I Detection via MP‐Locked Aptamer and Multimeric DNAzyme‐Coupled Hyperbranched Hybridization Chain Reaction

Small, EarlyView.
We report a magnetic particle anchored locked aptamer platform integrated with hyperbranched HCR and DNAzyme amplification for enzyme‐free, ultrasensitive detection of cardiac troponin I. The assay achieves a 0.25 ng/L detection limit within 25 minutes and enables cross‐species MI detection, with machine learning classification reaching 90% accuracy ...
Sayantan Tripathy, Sahil Sharma, Ng Ka Wai, Siddhant Jaitpal, Anthony Dongchau, Saugat Bhattacharyya, Sonya R. Wesselowski, Ashley B. Saunders, Gerard L. Coté, Samuel B. Mabbott   +9 more
wiley   +1 more source

Heuristics for the traveling repairman problem with profits [PDF]

, 2010
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs, Dirk, Cattrysse, Sofie, Coene, Spieksma, Frits CR, Vansteenwegen, Pieter   +4 more
core   +1 more source

State Transition Algorithm

, 2012
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation ...
A. H. Wright, A. K. Qin, C. Hamzacebi, C. Hamzacebi, D. D. Burgess, D. E. Goldberg, D. H. Wolpert, D. W. Stroock, F. J. Solis, F. V. Berth, G. Albeanu, G. Rudolph, H. A. Abbass, J. A. Nelder, J. C. Lagarias, J. J. Liang, J. Kennedy, J. Matyas, J. Y. Li, K. Deb, K. F. C. Yiu, P. Collet, R. C. Eberhart, R. Hooke, R. Storn, T. D. Tran, T. W. Leung, T. Zhang, X. J. Zhou, X. J. Zhou, X. S. Yang, Y. H. Shi, Y. X. Yuan, Z. Michalewicz   +33 more
core   +1 more source