The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Open accessAbstract
This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
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
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Vent, W. (1975) · Feddes Repertorium · doi:10.1002/fedr.19750860506 · Cited by 1,331
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
Genetic algorithms and their applications
Tang, K. S., Man, K. F., Kwong, S., & He, Q. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.543973 · Cited by 1,095
Alleles, loci and the traveling salesman problem
Goldberg, D. E., & Lingle, R. (1985) · international conference on Genetic algorithms · Cited by 881
Genetic Algorithms for the Traveling Salesman Problem
Grefenstette, J. J., Gopal, R., Rosmaita, B. J., et al. (1985) · international conference on Genetic algorithms · Cited by 731
A Connectionist Machine for Genetic Hillclimbing
Ackley, D. H. (1987) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1997-9 · Cited by 731
Applying adaptive algorithms to epistatic domains
Davis, L. D. (1985) · International Joint Conference on Artificial Intelligence · Cited by 642
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Whitley, L. D., Starkweather, T., & Fuquay, D. (1989) · international conference on Genetic algorithms · Cited by 551
Schedule Optimization Using Genetic Algorithms
Syswerda, G. (1991) · Medical Entomology and Zoology · Cited by 494
A Comparison of Genetic Sequencing Operators.
Starkweather, T., McDaniel, S. E., Mathias, K. E., et al. (1991) · Cited by 366
Evolution in Time and Space – The Parallel Genetic Algorithm
Mühlenbein, H. (1991) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-050684-5.50023-9 · Cited by 328
An evolutionary approach to the traveling salesman problem
Fogel, D. B. (1988) · Biological Cybernetics · doi:10.1007/bf00202901 · Cited by 287
Learning Bayesian network structures by searching for the best ordering with genetic algorithms
Larranaga, P., Kuijpers, C. M. H., Murga, R. H., & Yurramendi, Y. (1996) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.508827 · Cited by 267
Self-citationApplying the genetic approach to simulated annealing in solving some NP-hard problems
Lin, F.-T., Kao, C.-Y., & Hsu, C.-C. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.257766 · Cited by 252
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Gorges-Schleuter, M. (1989) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 242
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
FOGEL, D. B. (1993) · Cybernetics and Systems · doi:10.1080/01969729308961697 · Cited by 232
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
Optimization strategies gleaned from biological evolution
Brady, R. M. (1985) · Nature · doi:10.1038/317804a0 · Cited by 186
Genetic Operators for Sequencing Problems
Fox, B. R., & McMahon, M. B. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50021-5 · Cited by 170
USE OF A GENETIC ALGORITHM IN THE CRYPTANALYSIS OF SIMPLE SUBSTITUTION CIPHERS
Spillman, R. J., Janssen, M., Nelson, B., et al. (1993) · Cryptologia · doi:10.1080/0161-119391867746 · Cited by 133
THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS
Matthews, R. (1993) · Cryptologia · doi:10.1080/0161-119391867863 · Cited by 99
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Review of Deep Learning Algorithms and Architectures
Shrestha, A., & Mahmood, A. (2019) · IEEE Access · doi:10.1109/access.2019.2912200 · Cited by 1,883
GA: A Package for Genetic Algorithms in R
Scrucca, L. (2013) · Journal of Statistical Software · doi:10.18637/jss.v053.i04 · Cited by 837
Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach
Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., & Prasath, V. B. S. (2019) · Information · doi:10.3390/info10120390 · Cited by 668
Discrete cuckoo search algorithm for the travelling salesman problem
Ouaarab, A., Ahiod, B., & Yang, X.-S. (2014) · Neural Computing and Applications · doi:10.1007/s00521-013-1402-2 · Cited by 454
Metadata
- Authors
- Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., & Dizdarevic, S.
- Venue
- Artificial Intelligence Review
- Published
- 1999-04
- Volume
- 13
- Issue
- 2
- Pages
- 129-170
- ISSN
- 0269-2821 (ISSN-L)
- 1573-7462
- OpenAlex
- W2164866963
- Cited by
- 849
- References
- 31
- FWCI
- 9.36
- Type
- journal article
- Language
- en
- Open access
- green
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.