A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

1980 ◽  
pp. 108-114 ◽  
Author(s):  
T. H. C. Smith
Keyword(s):  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Enumeration Algorithm ◽  
Implicit Enumeration ◽  
Asymmetric Travelling Salesman Problem

S142011 A Solution for Asymmetric Travelling Salesman Problem with Time Windows Using Pre-Processed Compressed Annealing

2011 ◽  
Vol 2011 (0) ◽  
pp. _S142011-1-_S142011-5
Author(s):  
Tadanobu MIZOGAKI ◽  
Masao SUGI ◽  
Masashi YAMAMOTO ◽  
Hidetoshi NAGAI ◽  
Yusuke SHIOMI ◽  
...  
Keyword(s):  
Travelling Salesman Problem ◽  
Time Windows ◽  
Travelling Salesman ◽  
Asymmetric Travelling Salesman Problem

scholarly journals A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Julius Beneoluchi Odili ◽  
A. Noraziah ◽  
M. Zarina
Keyword(s):  
Performance Analysis ◽  
Optimization Algorithm ◽  
Travelling Salesman Problem ◽  
African Buffalo ◽  
Ant System ◽  
Travelling Salesman ◽  
Comparative Performance ◽  
Extremal Optimization ◽  
Insertion Algorithm ◽  
Asymmetric Travelling Salesman Problem

This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). Quite unlike the symmetric Travelling Salesman Problem, there is a paucity of research studies on the asymmetric counterpart. This is quite disturbing because most real-life applications are actually asymmetric in nature. These six algorithms were chosen for their performance comparison because they have posted some of the best results in literature and they employ different search schemes in attempting solutions to the ATSP. The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. After a number of experiments on the popular but difficult 15 out of the 19 ATSP instances in TSPLIB, the results show that the African Buffalo Optimization algorithm slightly outperformed the other algorithms in obtaining the optimal results and at a much faster speed.

Optimizing leaf sweeping and collection in the Argentine city of Trenque Lauquen

2020 ◽  
pp. 0734242X2092259 ◽  
Author(s):  
Diego Delle Donne ◽  
Valeria Di Tomaso ◽  
Guillermo Duran
Keyword(s):  
Linear Programming ◽  
Load Distribution ◽  
Travelling Salesman Problem ◽  
Work Load ◽  
Programming Models ◽  
Solution Strategy ◽  
Travelling Salesman ◽  
Working Day ◽  
The City ◽  
Asymmetric Travelling Salesman Problem

A solution strategy based on integer linear programming models has been developed for leaf sweeping operations in the Argentine city of Trenque Lauquen. The aim is to achieve efficiency in the assignment of sweepers to city blocks, the identification of leaf bag deposit points and the routes to be followed by collection trucks for leaf bag pickup. Previous to this strategy, sweeper assignments were improvised and inefficient, with blocks often left unswept. Furthermore, no method was available for accurately determining the number of sweepers needed to ensure either full coverage of all city zones within the working day or a balanced work load distribution across all sweepers. Application of the solution strategy by the city has resulted in efficient definitions of sweeper requirements while optimizing sweeper assignments such that all blocks are covered. Once the strategy is fully implemented, the number of bag deposit points under the manual definitions should be reduced by roughly one-half and the total travel distance of the truck routes, modelled as an asymmetric travelling salesman problem, should be cut by 10–15% with the consequent savings in time, vehicle use and fuel consumption.

Sign in / Sign up

Export Citation Format

Share Document