The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Abstract
The combination of local search heuristics and genetic algorithms is a promising approach for finding near-optimum solutions to the traveling salesman problem (TSP). An approach is presented in which local search techniques are used to find local optima in a given TSP search space, and genetic algorithms are used to search the space of local optima in order to find the global optimum. New genetic operators for realizing the proposed approach are described, and the quality and efficiency of the solutions obtained for a set of symmetric and asymmetric TSP instances are discussed. The results indicate that it is possible to arrive at high quality solutions in reasonable time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Foundations of genetic algorithms. 2
Booker, L. B. (1994) · Biosystems · doi:10.1016/0303-2647(94)90009-4 · Cited by 1,018
The traveling salesman: computational solutions for TSP applications
Reinelt, G. (1994) · Cited by 720
Ant-Q: A Reinforcement Learning approach to the traveling salesman problem
Gambardella, L. M., & Dorigo, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50039-6 · Cited by 605
Fast Algorithms for Geometric Traveling Salesman Problems
Bentley, J. J. (1992) · ORSA Journal on Computing · doi:10.1287/ijoc.4.4.387 · Cited by 468
A new adaptive multi-start technique for combinatorial global optimizations
Boese, K. D., Kahng, A. B., & Muddu, S. (1994) · Operations Research Letters · doi:10.1016/0167-6377(94)90065-5 · Cited by 356
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Gorges-Schleuter, M. (1989) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 242
Genetic local search algorithms for the traveling salesman problem
Ulder, N. L. J., Aarts, E., Bandelt, H., van Laarhoven, P. J. M., & Pesch, E. (1991) · Lecture notes in computer science · doi:10.1007/bfb0029740 · Cited by 220
A parallel tabu search algorithm for large traveling salesman problems
Fiechter, C.-N. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00033-i · Cited by 210
An Analysis of the Elastic Net Approach to the Traveling Salesman Problem
Durbin, R., Szeliski, R., & Yuille, A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.348 · Cited by 184
Results of the first international contest on evolutionary optimisation (1st ICEO)
Bersini, H., Dorigo, M., Stefan Langerman, C., Seront, G., & Gambardella, L. M. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1996.542670 · Cited by 92
Cited by
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Metadata
- Authors
- Freisleben, B., & Merz, P.
- Venue
- Proceedings of IEEE International Conference on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2002-12-23
- Pages
- 616-621
- OpenAlex
- W2096648407
- Cited by
- 277
- References
- 20
- FWCI
- 16.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.