The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem
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
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
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
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: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
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
Maniezzo, V., Gambardella, L. M., & de Luigi, F. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_5 · Cited by 403
Proceedings of the First International Conference on Genetic Algorithms and their Applications
(2014) · Psychology Press eBooks · doi:10.4324/9781315799674 · Cited by 367
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
Chen, S.-M., & Chien, C.-Y. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.04.163 · Cited by 254
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
A combinatorial Artificial Bee Colony algorithm for traveling salesman problem
Karaboga, D., & Gorkemli, B. (2011) · 2011 International Symposium on Innovations in Intelligent Systems and Applications · doi:10.1109/inista.2011.5946125 · Cited by 174
Mavrovouniotis, M., & Yang, S. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2013.05.022 · Cited by 153
Masutti, T. A. S., & de Castro, L. N. (2008) · Information Sciences · doi:10.1016/j.ins.2008.12.016 · Cited by 141
A new hybrid heuristic approach for solving large traveling salesman problem*1
TSAI, C. (2003) · Information Sciences · doi:10.1016/j.ins.2003.11.008 · Cited by 122
Solving the traveling salesman problem using cooperative genetic ant systems
Dong, G., Guo, W. W., & Tickle, K. S. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.10.012 · Cited by 114
A modified ant colony system for solving the travelling salesman problem with time windows
Cheng, C.-B., & Mao, C.-P. (2007) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2006.11.035 · Cited by 95
2007 International Joint Conference on Neural Networks (IJCNN 2007)
(2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.886917 · Cited by 53
Peker, M., Şen, B., & KUMRU, P. Y. (2013) · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · doi:10.3906/elk-1109-44 · Cited by 49
Casquilho, M. (2012) · Cited by 41
A Hybrid Algorithm of ACO and Delete-Cross Method for TSP
Jun-qiang, W., & Aijia, O. (2012) · International Conference on Industrial Control and Electronics Engineering · doi:10.1109/icicee.2012.448 · Cited by 25
Cited by
INFO: An efficient optimization algorithm based on weighted mean of vectors
Ahmadianfar, I., Heidari, A. A., Noshadian, S., Chen, H., & Gandomi, A. H. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116516 · Cited by 822
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
An efficient modified grey wolf optimizer with Lévy flight for optimization tasks
Heidari, A. A., & Pahlavani, P. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.06.044 · Cited by 464
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
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
Metadata
- Authors
- Mahi, M., Baykan, Ö. K., & Kodaz, H.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2015-05
- Volume
- 30
- Pages
- 484-490
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2074195549
- Cited by
- 379
- References
- 22
- FWCI
- 32.85
- 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.