Results 181 to 190 of about 28,852 (210)
Some of the next articles are maybe not open access.
Operations Research Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malik, Waqar +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malik, Waqar +2 more
openaire +2 more sources
An improved genetic algorithm for the multiple traveling salesman problem
2008 Chinese Control and Decision Conference, 2008In this paper, an improved genetic algorithm for the multiple traveling salesman problem was proposed. In the algorithm, a pheromone-based crossover operator is designed, and a local search procedure is used to act as the mutation operator. The pheromone-based crossover can utilize both the heuristic information, including edge lengths and adjacency ...
null Fanggeng Zhao +3 more
openaire +1 more source
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
2012In the uncapacitated asymmetric traveling salesman problem with multiple stacks, one first performs a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then delivers every item by performing a second hamiltonian circuit.
Sylvie Borne +2 more
openaire +1 more source
Evolutionary algorithm and decisional DNA for multiple travelling salesman problem
Neurocomputing, 2015In the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowledge structures (SOEKS) and evolutionary algorithms ...
Wang, Peng +2 more
openaire +1 more source
Improved Multiple Ant Colonies System for Traveling Salesman Problems
2002Recently, many kinds of approximate optimization methods have been proposed. The ant system (AS), which is originally proposed by Dorigo et al, is one such algorithm. To improve the basic performance of the AS algorithm, we developed the AS into a multiple ant colonies system (MACS) by introducing multiple colonies and colony-level interactions.
Hidenori Kawamura +2 more
openaire +1 more source
Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem
2014A kind of equal-task multiple traveling salesman problem (ET-mTSP) was proposed based on the mTSP and its corresponding mathematical model was constructed; Then, a series of discrete operations for firefly algorithm (FA) were conducted to solve this problem; Finally, the results and analysis of experiments showed that the improved algorithm was ...
Jianhua Ma +3 more
openaire +1 more source
Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems
NetworksABSTRACTRecently, routing problems have made significant progress and exhibited remarkable performance across various domains. However, they still suffer from severe issues, including high computational complexity and path intersection phenomenon, which curtail their broader applicability.
Qingshu Guan +4 more
openaire +1 more source
Home health care problem: An extended multiple Traveling Salesman Problem
2009This paper deals with the routing problem of health care sta in a home health care problem. Given a list of patients needing several cares, the problem is to assign cares to care workers. Some cares have to be performed by several persons and some cares cannot be performed with others.
Kergosien, Yannick +2 more
openaire +1 more source
Firefly Algorithm Solving Multiple Traveling Salesman Problem
Journal of Computational and Theoretical Nanoscience, 2015Mingfu Li +4 more
openaire +1 more source