The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
The Hyper-Cube Framework for Ant Colony Optimization
Abstract
Ant colony optimization is a metaheuristic approach belonging to the class of model-based search algorithms. In this paper, we propose a new framework for implementing ant colony optimization algorithms called the hyper-cube framework for ant colony optimization. In contrast to the usual way of implementing ant colony optimization algorithms, this framework limits the pheromone values to the interval [0,1]. This is obtained by introducing changes in the pheromone value update rule. These changes can in general be applied to any pheromone value update rule used in ant colony optimization. We discuss the benefits coming with this new framework. The benefits are twofold. On the theoretical side, the new framework allows us to prove that in Ant System, the ancestor of all ant colony optimization algorithms, the average quality of the solutions produced increases in expectation over time when applied to unconstrained problems. On the practical side, the new framework automatically handles the scaling of the objective function values. We experimentally show that this leads on average to a more robust behavior of ant colony optimization algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Self-citationBertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
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
Self-citationEvolutionary Games and Population Dynamics
Hofbauer, J., & Sigmund, K. (1998) · doi:10.1017/cbo9781139173179 · Cited by 5,502
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Dorigo, M., & Stützle, T. (2004) · The MIT Press eBooks · doi:10.7551/mitpress/1290.001.0001 · Cited by 3,330
Self-citationHoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
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
Self-citationOR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.166 · Cited by 1,899
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
Levinson, S. E., Rabiner, L. R., & Sondhi, M. M. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03114.x · Cited by 978
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
Self-citationLinear and nonlinear programming
Sydsæter, K., Strøm, A., & Berck, P. (1999) · Economists’ Mathematical Manual · doi:10.1007/978-3-662-03995-3_15 · Cited by 864
Lau, H. T. (1986) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-61649-5_4 · Cited by 796
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2021) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-030-85450-8 · Cited by 696
Removing the Genetics from the Standard Genetic Algorithm
Baluja, S., & Caruana, R. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50014-1 · Cited by 573
Growth transformations for functions on manifolds
Baum, L. E., & Sell, G. (1968) · Pacific Journal of Mathematics · doi:10.2140/pjm.1968.27.211 · Cited by 363
OR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1038/sj/jors/0411109 · Cited by 256
Model-Based Search for Combinatorial Optimization: A Critical Survey
Zlochin, M., Birattari, M., Meuleau, N., & Dorigo, M. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039526.52305.af · Cited by 247
Self-citationA First Course in Discrete Dynamical Systems
Holmgren, R. A. (1994) · Universitext · doi:10.1007/978-1-4684-0222-3 · Cited by 234
Adaptive Memory Tabu Search for Binary Quadratic Programs
Glover, F., Kochenberger, G. A., & Alidaee, B. (1998) · Management Science · doi:10.1287/mnsc.44.3.336 · Cited by 209
Heuristic algorithms for the unconstrained binary quadratic programming problem
Beasley, J. E. (1998) · Cited by 157
Model-Based Search for Combinatorial Optimization: A Comparative Study
Zlochin, M., & Dorigo, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_63 · Cited by 30
Self-citationAnt colony optimization for the edge-weighted k -cardinality tree problem
Blum, C. (2002) · Cited by 16
Self-citation
Cited by
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
Self-citationAnt Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_10 · Cited by 722
Self-citationAnt 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
Self-citation
Metadata
- Authors
- Blum, C., & Dorigo, M.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2004-04
- Volume
- 34
- Issue
- 2
- Pages
- 1161-1172
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2162125251
- Cited by
- 432
- References
- 26
- FWCI
- 25.76
- 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.