The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
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
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Distributed Optimization by Ant Colonies
Colorni, A., Dorigo, M., Maniezzo, V., Varela, F. J., & Bourgine, P. (1992) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 2,748
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Genetic Algorithms and Engineering Design
Gen, M., & Cheng, R. (1996) · Wiley eBooks · doi:10.1002/9780470172254 · Cited by 2,460
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
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
Genetic Algorithms and Engineering Design
Coit, D. W. (1998) · The Engineering Economist · doi:10.1080/00137919808903206 · Cited by 1,236
A new rank based version of the Ant System. A computational study.
Bullnheimer, B., Hartl, R. F., & Strauß, C. (1997) · ePubWU Institutional Repository (Wirtschaftsuniversität Wien) · doi:10.57938/2eb99227-a596-4eb4-bb7d-367b53dee89d · Cited by 793
Simulated annealing: Theory and applications
Rota, G. (1988) · Advances in Mathematics · doi:10.1016/0001-8708(88)90072-2 · Cited by 607
Solving symmetric and asymmetric TSPs by ant colonies
Gambardella, L. M., & Dorigo, M. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542672 · Cited by 506
A Novel Approach for Unit Commitment Problem via an Effective Hybrid Particle Swarm Optimization
Ting, T. O., Rao, M. V. C., & Loo, C. K. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.860907 · Cited by 446
Self-organizing feature maps and the travelling salesman problem
Angéniol, B., de La Croix Vaubois, G., & Le Texier, J.-Y. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90002-0 · Cited by 340
Krohling, R. A., & dos Santos Coelho, L. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.873185 · Cited by 326
A hybrid genetic – Particle Swarm Optimization Algorithm for the vehicle routing problem
Marinakis, Y., & Marinaki, M. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.085 · Cited by 230
Combining simulated annealing with local search heuristics
Martin, O. C., & Otto, S. W. (1996) · Annals of Operations Research · doi:10.1007/bf02601639 · Cited by 216
Lin, C.-J., Chen, C.-H., & Lin, C.-T. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2002333 · Cited by 188
Exchange strategies for multiple Ant Colony System
Ellabib, I., Calamai, P. H., & Basir, O. (2006) · Information Sciences · doi:10.1016/j.ins.2006.09.016 · Cited by 147
Masutti, T. A. S., & de Castro, L. N. (2008) · Information Sciences · doi:10.1016/j.ins.2008.12.016 · Cited by 141
Improving the Ant System: A Detailed Report on the MAX-MIN Ant System
St�tzle, T., & Hoos, H. H. (1996) · Cited by 128
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem
Cochrane, E., & Beasley, J. E. (2003) · Neural Networks · doi:10.1016/s0893-6080(03)00056-x · Cited by 101
Aras, N., Oommen, B. J., & Altınel, İ. K. (1999) · Neural Networks · doi:10.1016/s0893-6080(99)00063-5 · Cited by 98
Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)
Xie, X., & Liu, J. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2006910 · Cited by 89
Tomasz, D. G. (2006) · Cited by 41
Improved Ant Colony Optimization for the Traveling Salesman Problem
Li, L., Ju, S., & Zhang, Y. (2008) · International Conference on Intelligent Computation Technology and Automation · doi:10.1109/icicta.2008.265 · Cited by 34
Sauer, J. G., & Coelho, L. D. S. (2008) · IEEE International Conference on Cybernetic Intelligent Systems (CIS) · doi:10.1109/ukricis.2008.4798955 · Cited by 21
An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows
Shi, X., Wang, L., Zhou, Y., & Liang, Y. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.470 · Cited by 16
Chien, C.-Y., & Chen, S. (2009) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2009.5212601 · Cited by 10
Self-citation
Cited by
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Zhang, Y., Wang, S., & Ji, G. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/931256 · Cited by 1,146
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
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
Mahi, M., Baykan, Ö. K., & Kodaz, H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.01.068 · Cited by 379
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Osaba, E., Yang, X.-S., Diaz, F., Lopez-Garcia, P., & Carballedo, R. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.10.006 · Cited by 312
Metadata
- Authors
- Chen, S.-M., & Chien, C.-Y.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2011-11
- Volume
- 38
- Issue
- 12
- Pages
- 14439-14450
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2052257324
- Cited by
- 254
- References
- 35
- FWCI
- 16.26
- Type
- journal article
- 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.