A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A novel sparrow search algorithm for the traveling salesman problem
2021
IEEE Access
Preserved Fulltext
The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). ...
To address this issue, we propose a novel greedy genetic sparrow search algorithm based on a sine and cosine search strategy (GGSC-SSA). ...
The authors would like to thank the anonymous reviewers and Academic Editor for their valuable and constructive comments, which greatly improved the quality and integrity of this manuscript. ...
doi:10.1109/access.2021.3128433
fatcat:jcswcawlwbd7zhfxkpzcjcofse
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The Travelling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. ...
We propose in this paper a new memetic algorithm based on the well-known Breakout Local Search (BLS) metaheuristic to provide good solutions for GTSP instances. ...
Introduction The Generalized Travelling Salesman Problem (GTSP) is an extension of the well-known Travelling Salesman Problem (TSP), they are both Combinatorial Optimization Problems (COP). ...
arXiv:1911.01966v1
fatcat:2k7jbhmxyjfonbiaaezkx7m7zi
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
[chapter]
2008
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments The authors thank Leonora Bianchi for providing the source code of 2-p-opt and 1-shift. This research has been supported by COMP 2 SYS, a Marie Curie Training ACS/1-shift. ...
The authors acknowledge support from the fund for scientific research F.R.S.-FNRS of the French Community of Belgium. ...
The probabilistic traveling salesman problem The PTSP [13] is a paradigmatic example of routing problems under uncertainty. ...
doi:10.1007/978-3-540-70807-0_4
fatcat:3zcmmyejargotnnrwq55hz3atu
A Taxonomyof Intelligent Algorithms used for Solving Traveling Salesman Problem (TSP) in the Year 2019
2021
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Travel salesman problem (TSP) considered as one of the most important complex optimization problem. ...
In our research we reviewed related published articles in the year 2019(Scopus database), to find the state-of-art in Solving Travel Salesman Problem (TSP) by different intelligent algorithms. ...
"A Variable Neighborhood Search for Flying Sidekick Traveling Salesman Problem." ...
doi:10.5281/zenodo.4785093
fatcat:s62cji4vvfdwdnrolrrbb75t5m
Evaluating the Performance of Ant Colony Algorithm for the Solution of Constraint Based Traveling Salesman Problem
2016
International Journal Of Engineering And Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Soft Computing is the use of inexact solution to computationally hard tasks such as the solution of NP-Complete problems.TSP is a combinatorial optimization problem. ...
In order to find an optimal solution for TSP problem the presented paper proposes an improved ACO which produces better result. ...
Dorigo and Gambardella (1997) proposed a distributed algorithm ant colony system for solving travelling salesman problem. ...
doi:10.18535/ijecs/v5i9.20
fatcat:f5dtubc2avfdpgoqhibrf6tuii
A Review of the Optimization Algorithms on Traveling Salesman Problem
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It also relates the traveling salesman problem with the available algorithms and provides the advantages in providing a solution for TSP. ...
optimal solution for the traveling salesman problem. ...
They presented an approach for solving traveling salesman problem based on improved ant colony algorithm. ...
doi:10.17485/ijst/2015/v8i1/84652
fatcat:pigy2l32bzh7nnjcqmmnqa354u
Exact time-efficient combined algorithm for solving the asymmetric traveling salesman problem
2018
Business Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Quite often, the features of these problems lead to the traveling salesman problem in asymmetric formulation (asymmetric traveling salesman problem, ATSP). ...
Аbstract For practical, important tasks in the fi elds of economics and logistics, as well as in a number of technical applications, it becomes necessary to solve the traveling salesman problem (TSP). ...
The authors see the further development of the study in a more detailed analysis of the distributions of running time of software implementations of the algorithms. ...
doi:10.17323/1998-0663.2018.3.20.28
fatcat:t3rmmrc3mjdy3mhyghz6chly2u
Ant Colony Algorithm Based on Path Planning for Mobile Agent Migration
2011
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
; Second, for ant colony algorithm to solve such problems in need long search time and ease into a local minimum shortcomings, the introduction of genetic algorithms and ant colony algorithm for global ...
Analysis of the travel agent questions (Travelling Agent Problem, TAP), and that it is a class of complex combinatorial optimization problems, mobile agent migration path planning is the most classic problems ...
So, traveling salesman problem on an abstract figure in the search for the shortest Hamilton circuit [2] . ...
doi:10.1016/j.proeng.2011.11.2456
fatcat:4nwrp3jxznajfdljxnwtkqu6de
A Tour Construction Heuristic for the Travelling Salesman Problem
1999
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Keywords: travelling salesman; heuristics; local search; global search
Introduction
The travelling salesman problem (TSP) can be described as follows: a salesman tries to find the shortest closed route ...
, USA
The tour construction heuristic that generates initial tours for the tour improvement heuristics plays an important role in solving the travelling salesman problem (TSP). ...
doi:10.2307/3010339
fatcat:au6wqkppxrgc7dttwiilppyuo4
Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming
2018
Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The traveling-salesman problem can be regarded as an NP-hard problem. ...
This paper proposes a new algorithm based on simulated annealing and gene-expression programming to better solve the problem. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/info10010007
fatcat:jjhcvrh4ujci3eqxxgv57fptzy
Parallel Branch And Bound Model Using Logarithmic Sampling (Pbls) For Symmetric Traveling Salesman Problem
2007
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The main focus of the algorithm is to solve the "symmetric traveling salesman problem". ...
One of the most popular and most complicate problems of this family is "Traveling Salesman Problem". ...
But to date, no one has been able to find a polynomial-time algorithm to solve the Traveling Salesman Problem. ...
doi:10.5281/zenodo.1060986
fatcat:c2kazreqp5bxhalkmxloztzguu
Page 748 of The Journal of the Operational Research Society Vol. 55, Issue 7
[page]
2004
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
New results on the
old k-opt algorithm for the traveling salesman problem. S/4M J Comput 28: 1998-2029.
Received September 2002; accepted March 2004 after one revision ...
The traveling salesman problem: a case study. In: E Aarts and JK Lenstra (eds). Local Search in Combinatorial Optimization. John Wiley & Sons, New York, pp 215-310. ...
Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA)
2020
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The aim of the paper is to improve and enhance the performance of genetic algorithms to solve the Traveling Salesman Problem (TSP) by proposing and developing a new Crossover mechanism and a local search ...
algorithm called the Search for Neighboring Solution Algorithm, with the goal of producing a better solution in a shorter period of time and fewer generations. ...
ACKNOWLEDGMENTS The researcher gratefully acknowledges and highly appreciates the financial support and the remarkable resources provided by WISE University, Jordan. ...
doi:10.14569/ijacsa.2020.0110649
fatcat:cvdk7k2cebczlikzsj6nyh46hm
Page 1581 of Mathematical Reviews Vol. , Issue 2000b
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
graphs for the traveling salesman problem: at most four moves from tour to tour. ...
In order to describe this problem, a new algebra is introduced.”
2000b:90062 90C27 90C35 Gutin, Gregory (4-BRNL; Uxbridge) Exponential neighbourhood local search for the traveling salesman problem. ...
Page 480 of The Journal of the Operational Research Society Vol. 58, Issue 4
[page]
2007
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
An_ effective heuristic algorithm for the traveling-salesman problem. Opns Res 21: 498-516.
Mladenovic N and Hansen P (1997). Variable neighborhood search. Comput Opns Res 24: 1097-1100. ...
A fast composite heuristic for the symmetric traveling salesman problem. /nforms J Comput 8: 134-143.
Renaud J, Boctor FF and Laporte G (2004). Efficient heuristics for
median cycle problems. ...
« Previous
Showing results 1 — 15 out of 19,615 results