The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Discrete cuckoo search algorithm for the travelling 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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
Self-citationA New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Self-citationFirefly Algorithms for Multimodal Optimization
Yang, X.-S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04944-6_14 · Cited by 4,075
Self-citation(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
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
Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Self-citationAnt 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
Krill herd: A new bio-inspired optimization algorithm
Gandomi, A. H., & Alavi, A. H. (2012) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.05.010 · Cited by 1,882
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Hossein Gandomi, A. (2012) · Engineering Computations · doi:10.1108/02644401211235834 · Cited by 1,751
Self-citationThe 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
A Method for Solving Traveling-Salesman Problems
Croes, G. A. (1958) · Operations Research · doi:10.1287/opre.6.6.791 · Cited by 1,570
The Traveling Salesman Problem and Its Variations
(2007) · Combinatorial Optimization · doi:10.1007/b101971 · Cited by 1,392
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Gandomi, A. H. (2012) · Middlesex University Research Repository (Middlesex University Of London) · Cited by 1,057
Self-citationGenetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., & Dizdarevic, S. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006529012972 · Cited by 849
Mixed variable structural optimization using Firefly Algorithm
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2011) · Computers & Structures · doi:10.1016/j.compstruc.2011.08.002 · Cited by 804
Self-citationLévy Flights and Related Topics in Physics
Shlesinger, M. F., Zaslavsky, G. M., & Frisch, U. (1995) · Lecture notes in physics · doi:10.1007/3-540-59222-9 · Cited by 737
The traveling salesman: computational solutions for TSP applications
Reinelt, G. (1994) · Cited by 720
The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm
Hosseini, H. S. (2009) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2009.022775 · Cited by 473
The Cuckoos: Bird Families of the World
Payne, R. B. (2005) · doi:10.1093/oso/9780198502135.001.0001 · Cited by 369
Lévy Flights in Dobe Ju/’hoansi Foraging Patterns
Brown, C. T., Liebovitch, L. S., & Glendon, R. (2007) · Human Ecology · doi:10.1007/s10745-006-9083-4 · Cited by 346
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
Monkey search: a novel metaheuristic search for global optimization
Mucherino, A., Şeref, O., Şeref, O., Kundakcioglu, O. E., & Pardalos, P. M. (2007) · AIP conference proceedings · doi:10.1063/1.2817338 · Cited by 286
Some Simple Applications of the Travelling Salesman Problem
Lenstra, J. K., & Kan, A. H. G. R. (1975) · Journal of the Operational Research Society · doi:10.1057/jors.1975.151 · Cited by 270
Chen, S.-M., & Chien, C.-Y. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.04.163 · Cited by 254
The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Bonomi, E., & Lutton, J.-L. (1984) · SIAM Review · doi:10.1137/1026105 · Cited by 251
Adaptive memory programming: A unified view of metaheuristics
Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00268-x · Cited by 217
Design optimization of truss structures using cuckoo search algorithm
Gandomi, A. H., Talatahari, S., Yang, X., & Deb, S. (2013) · The Structural Design of Tall and Special Buildings · doi:10.1002/tal.1033 · Cited by 169
Self-citationAdaptive Memory Programming: A Unified View of Meta-Heuristics
Taillard, É. D., Gambardella, L. M., Michel Gendreau, A., & Potvin, J. (1998) · doi:10.71910/supsi.7446 · Cited by 164
Cited by
Monarch butterfly optimization
Wang, G.-G., Deb, S., & Cui, Z. (2019) · Neural Computing and Applications · doi:10.1007/s00521-015-1923-y · Cited by 983
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Nature-inspired optimization algorithms: Challenges and open problems
Yang, X.-S. (2020) · Journal of Computational Science · doi:10.1016/j.jocs.2020.101104 · Cited by 429
Self-citationMoth–flame optimization algorithm: variants and applications
Shehab, M., Abualigah, L., Al Hamad, H., Alabool, H., Alshinwan, M., & Khasawneh, A. M. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04570-6 · Cited by 316
Metadata
- Authors
- Ouaarab, A., Ahiod, B., & Yang, X.-S.
- Venue
- Neural Computing and Applications
- Published
- 2013-04-11
- Volume
- 24
- Issue
- 7-8
- Pages
- 1659-1669
- ISSN
- 0941-0643 (ISSN-L)
- 1433-3058
- OpenAlex
- W1975671633
- Cited by
- 454
- References
- 34
- FWCI
- 34.23
- 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.