The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The ant system applied to the quadratic assignment problem
Abstract
In recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. We describe a distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies, and we propose its use for the quadratic assignment problem. The results obtained in solving several classical instances of the problem are compared with those obtained from other evolutionary heuristics to evaluate the quality of the proposed system.
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
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
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
Self-citationGlover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
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
Self-citationAssignment Problems and the Location of Economic Activities
Koopmans, T. C., & Beckmann, M. (1957) · Econometrica · doi:10.2307/1907742 · Cited by 2,308
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Tabu Search Applied to the Quadratic Assignment Problem
Skorin‐Kapov, J. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.33 · Cited by 458
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Gilmore, P. C. (1962) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0110022 · Cited by 448
Cited by
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
Self-citationAnt 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
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
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Inspiration for optimization from social insect behaviour
Bonabeau, E., Dorigo, M., & Theraulaz, G. (2000) · Nature · doi:10.1038/35017500 · Cited by 912
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
MAX-MIN Ant System and local search for the traveling salesman problem
Stutzle, T., & Hoos, H. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592327 · Cited by 831
Dorigo, M., Bonabeau, E., & Theraulaz, G. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00042-x · Cited by 816
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
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
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
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
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
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
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
Self-citationSwarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Power load forecasting using support vector machine and ant colony optimization
Niu, D., Wang, Y., & Wu, D. D. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.08.019 · Cited by 391
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
Hybrid flow shop scheduling considering machine electricity consumption cost
Luo, H., Du, B., Huang, G. Q., Chen, H., & Li, X. (2013) · International Journal of Production Economics · doi:10.1016/j.ijpe.2013.01.028 · Cited by 381
An Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP)
Liang, Y.-C., & Smith, A. E. (2004) · IEEE Transactions on Reliability · doi:10.1109/tr.2004.832816 · Cited by 374
A Graph-based Ant System and its convergence
Gutjahr, W. J. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00044-3 · Cited by 368
Agrawal, S., & Tiwari, M. K. (2008) · International Journal of Production Research · doi:10.1080/00207540600943985 · Cited by 252
Introducing a new intelligent adaptive learning content generation method
Haghshenas, E., Mazaheri, A., Gholipour, A., Tavakoli, M., Zandi, N., Narimani, H., Rahimi, F., & Nouri, S. (2010) · The Second International Conference on E-Learning and E-Teaching (ICELET 2010) · doi:10.1109/icelet.2010.5708382 · Cited by 14
Metadata
- Authors
- Maniezzo, V., & Colorni, A.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1999
- Volume
- 11
- Issue
- 5
- Pages
- 769-778
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2140481494
- Cited by
- 744
- References
- 17
- FWCI
- 26.45
- 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.