The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
MAX-MIN Ant System and local search for the traveling salesman problem
Abstract
Ant System is a general purpose algorithm inspired by the study of the behavior of ant colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. We introduce MAX-MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the well known traveling salesman problem. We show how MAX-MIN Ant System can be significantly improved, extending it with local search heuristics. Our results clearly show that MAX-MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours.
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
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
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
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
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Lau, H. T. (1986) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-61649-5_4 · Cited by 796
The ant system applied to the quadratic assignment problem
Maniezzo, V., & Colorni, A. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806935 · Cited by 744
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
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
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
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Self-citationThe Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Dorigo, M., & Stützle, T. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_9 · Cited by 864
Dorigo, M., Bonabeau, E., & Theraulaz, G. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00042-x · Cited by 816
A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Gao, Y., Guan, H., Qi, Z., Hou, Y., & Liu, L. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.02.004 · Cited by 671
A survey of swarm intelligence for dynamic optimization: Algorithms and applications
Mavrovouniotis, M., Li, C., & Yang, S. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.12.005 · Cited by 585
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_8 · Cited by 579
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
Swarm Intelligence: A Review of Algorithms
Chakraborty, A., & Kar, A. K. (2017) · Modeling and Optimization in Science and Technologies · doi:10.1007/978-3-319-50920-4_19 · Cited by 447
A short convergence proof for a class of ant colony optimization algorithms
Stutzle, T., & Dorigo, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802444 · Cited by 427
Self-citationA Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
Text feature selection using ant colony optimization
Aghdam, M. H., Ghasem-Aghaee, N., & Basiri, M. E. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.08.022 · Cited by 389
Time dependent vehicle routing problem with a multi ant colony system
Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.047 · Cited by 374
Chen, W.-N., & Zhang, J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2001722 · Cited by 362
Study of Reconfiguration for the Distribution System With Distributed Generators
Wu, Y.-K., Lee, C.-Y., Liu, L.-C., & Tsai, S.-H. (2010) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2010.2046339 · Cited by 336
Rich Vehicle Routing Problem: Survey
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2015) · ACM Computing Surveys · doi:10.1145/2666003 · Cited by 280
Metadata
- Authors
- Stutzle, T., & Hoos, H.
- Venue
- Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
- Publisher
- IEEE
- Published
- 2002-11-22
- Pages
- 309-314
- OpenAlex
- W2107631366
- Cited by
- 831
- References
- 18
- FWCI
- 20.12
- 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.