Pith. sign in

REVIEW 6 major objections 4 minor 55 references

Evolution of Ant Colony Optimization Algorithm -- A Brief Literature Review

T0 review · 6 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This literature review claims that Ant Colony Optimization has matured into a broadly applicable swarm-intelligence metaheuristic through post-2010 advances in applications and algorithmic engineering.

desk verdict A readable but citation-unreliable literature review of recent ACO; useful as a skimming entry point, not as a trusted map. read the letter →

arxiv 1908.08007 v2 pith:2AQIZUJM submitted 2019-08-15 cs.NE cs.AI

Aleem Akhtar This is my paper · ORCID
classification cs.NEcs.AI
keywords antcolonyoptimizationswarmintelligencemetaheuristicsliteraturereviewmulti-objectivecontinuousdynamicparallelcomputing
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This review article is trying to establish that Ant Colony Optimization (ACO) has evolved from the earliest Ant System into a significant algorithm in swarm intelligence, and that recent developments after 2010 can be organized into two streams: applications and algorithmic development. If the map it draws is accurate, a reader gains a compact orientation to where ACO research stands, including multi-objective optimization, continuous optimization, time-varying NP-hard problems, hybridization with other metaheuristics, and parallel implementations. The paper's value is organizational: it tells a newcomer which landmark ideas and active research lines matter.

What carries the argument

The machinery carrying the review is the ACO metaheuristic itself: a population of artificial ants that communicate indirectly through pheromone traces on a graph and iterate through initialization, solution construction, optional local search, and global pheromone update. The review's organizing framework is a two-track taxonomy—application extensions (multi-objective, continuous, dynamic) versus algorithmic extensions (hybridization, constraint integration, parallel implementations)—with named variants ACOR (continuous optimization via Gaussian kernel functions) and MOACO (a generic multi-objective ACO framework) anchoring those tracks.

What would settle it

Checking reference [49] against its description in Section 4.3—whether that paper actually surveys fine- and coarse-grained parallelization—would settle whether the review's coverage of parallel ACO is trustworthy.

Watch

Extended reading notes

Core claim

The paper's central claim is that ACO, after modest beginnings, has become a significant swarm-intelligence metaheuristic, and that the post-2010 literature falls into two broad tracks. On the application track, ACO has been extended to multi-objective problems through generic MOACO frameworks and indicator-based variants, to continuous optimization through ACOR and its refinements with growing populations and local search, and to time-varying NP-hard problems such as dynamic traveling salesman and vehicle routing. On the algorithmic track, improvements come from hybridizing ACO with other metaheuristics such as tabu search, from integrating it with constraint propagation and column generation for highly constrained problems, and from parallel implementations on multicore CPUs and GPUs. The paper is a map of these developments, not an experimental study of a new algorithm.

Load-bearing premise

The review's usefulness depends on each cited paper being summarized accurately; in particular, the parallelization section rests on reference [49] actually being an overview of fine- and coarse-grained strategies.

Editorial extensions

If this is right

  • Hybridizing ACO with local search or other metaheuristics yields better solutions than the plain Ant System, especially on hard combinatorial problems like the traveling salesman problem.
  • The ACOR line of work, particularly when combined with automatic algorithm configuration, gives ACO a competitive route into continuous black-box optimization rather than only combinatorial problems.
  • Automatically designed multi-objective ACO variants can outperform earlier hand-designed ACO algorithms in the tested settings.
  • Coarse-grained parallel ACO, in which sub-colonies exchange information only occasionally, is more effective than fine-grained schemes, and GPU implementations add further speed-up.
  • Integrating ACO with constraint propagation or column generation makes it practical for highly constrained scheduling and routing problems where feasibility is the main challenge.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The review leaves implicit that the same ACO core could be benchmarked across dynamic, multi-objective, and continuous problem sets to test whether recent gains are generic or track-specific.
  • A likely extension of the automatic-configuration results is that ACO development shifts from hand-tuned pheromone rules toward configuring reusable algorithm components per problem class.
  • A fuller map of the field would need to include theoretical convergence results and negative results, which the present review does not cover.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

6 major / 4 minor

Summary. The paper is a brief narrative literature review of Ant Colony Optimization (ACO) after 2010. It summarizes developments in three application areas (multi-objective optimization, continuous optimization, dynamic NP-hard problems) and two algorithmic directions (hybridization and parallel implementations). The paper contains no mathematical results, data analyses, or original algorithmic contributions; its central claim is to provide a trustworthy map of recent ACO research. The value of the review thus hinges entirely on the accuracy of its summaries and citations.

Significance. If its summaries were accurate, the paper would provide a concise entry point for researchers seeking a quick overview of recent ACO developments. The structure is clear and the selection of topics is representative of active research areas. However, the paper offers no critical evaluation of the surveyed methods, no quantitative comparisons, and no new insights, so its significance is limited to that of a possibly useful but shallow bibliography. The presence of multiple mischaracterizations of the cited literature substantially reduces its usefulness as a reliable source.

major comments (6)
  1. [Section 4.3] The text states that Merkle et al. [49] 'provides a brief overview of both approaches' (fine- and coarse-grained parallelization), but reference [49] is Merkle and Middendorf, 'Modeling the dynamics of ant colony optimization' (Evolutionary Computation 10(3), 2002), a paper on modeling pheromone dynamics, not a survey of parallelization strategies. This citation does not support the sentence and must be replaced with a source that actually reviews parallel ACO.
  2. [Section 4.2] The claim that 'Oliveira et al [42] presented use of tabu search for quadratic assignment problem' is not supported by reference [42], which is an analysis of the population-based ACO algorithm for the TSP and QAP, not a proposal of a tabu-search hybrid. The citation and the attributed content need to be corrected.
  3. [Section 4.2] The sentence 'Stutzle et al [43] ... in the form of iterated ants' mischaracterizes reference [43], which is the 'Iterated Greedy' handbook chapter by Stützle and Ruiz, a description of the iterated greedy metaheuristic that does not involve ants. The described technique (constructing solutions from partial solutions) is not presented in [43].
  4. [Section 4.2] The sentence 'Blum et al [45] presented an approach that require integration of ants solutions construction with constraint propagation mechanism' attributes a specific algorithmic proposal to reference [45], which is a survey of hybrid metaheuristics (Blum et al., Applied Soft Computing 11(6), 2011). A survey may discuss such approaches, but the citation should point to the original source of the integrated ACO/constraint-propagation method.
  5. [Section 4.1] The sentence 'Unified structure was able to generate ACO algorithms using Irace ... that outperformed all the earlier versions presented in the literature [40]' cites the irace package paper [40] for experimental results that are actually reported by Liao et al. in the unified ACO paper [39]. The citation should be [39], not [40].
  6. [Section 4.3] The sentence 'Uchida et al [50] used this technique to present results that proved running p independent sub-colonies an effective technique' uses reference [50], which is a GPU implementation of ACO for the TSP, to support a claim about coarse-grained multi-colony approaches. The technique described in [50] is not a coarse-grained sub-colony model, so this citation is also inconsistent with the text.
minor comments (4)
  1. [Throughout] Numerous typos and mangled names appear: 'meateuristic' in Section 1 should be 'metaheuristic'; 'phero mone' is split in the Abstract; 'course grained' in Section 4.3 should be 'coarse grained'; 'Lp ez-Ibez and Sttzle' and 'Falcn-Cardona' in Section 4.1 are corrupted names. These need correction.
  2. [Section 1] The review does not state its methodology for selecting papers (search databases, inclusion/exclusion criteria, time window). For a literature review, this omission is important, especially given the citation inaccuracies elsewhere.
  3. [Section 5] The Conclusion repeats the abstract almost verbatim and does not synthesize any trends or open problems; a brief synthesis would add value to the review.
  4. [Section 4] The time window is described as 'after 2010' but at least one reference (Hara et al. [44]) is from 2010, and others are from 2011; the precise inclusion window should be stated.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper is a literature review with no predictive or derivational claims, and citation-accuracy concerns are a correctness issue, not a circularity issue.

full rationale

This manuscript is a narrative literature review of ACO developments and makes no formal derivation, no fitted prediction, and no equation that reduces to an input. Its central claim, stated in the abstract, is that it 'presents a brief overview of recent developments carried out in ACO algorithms in terms of both applications and algorithmic developments,' which is a summarizing claim rather than a derived result. No parameter is fitted and later called a prediction; no quantity is defined in terms of the quantity it is supposed to explain; and the author does not invoke any prior theorem or result as load-bearing support for a conclusion. The paper contains no self-citations by the author, so the self-citation patterns do not apply. The reviewer's concern about Sections 4.2 and 4.3 is that certain cited references may not support the claims attributed to them, for example citing Merkle and Middendorf [49] as providing 'a brief overview' of fine- and coarse-grained parallelization when that paper models ACO dynamics. That concern is about citation accuracy and factual reliability, which are correctness risks, not circular reasoning: an inaccurate map of the literature is still not a case where the review's conclusion is built into its inputs by definition. The circularity burden for this paper is therefore zero, and an honest non-finding is appropriate.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The paper introduces no free parameters and no new entities. Its content is entirely drawn from prior literature, so the main structural assumption is that the cited works are faithfully represented.

assumptions (2)
  • domain assumption The cited papers are accurately summarized and are representative of the field's recent developments.
    The review's usefulness rests on this assumption. Section 4.3's treatment of reference [49] shows this assumption is not always met.
  • domain assumption ACO is a meaningful algorithmic framework whose standard formulation (pheromone updates, solution construction) is as described.
    The paper relies on standard ACO descriptions from Dorigo et al. without re-deriving them.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Evolution of Ant Colony Optimization Algorithm -- A Brief Literature Review." pith.science (2026). https://pith.science/paper/2AQIZUJM

@misc{pith2026190808007,
  author       = {Pith},
  title        = {Pith review of: Evolution of Ant Colony Optimization Algorithm -- A Brief Literature Review},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2AQIZUJM}},
  note         = {Machine review of arXiv:1908.08007}
}
read the original abstract

Ant Colony Optimization (ACO) is a metaheuristic proposed by Marco Dorigo in 1991 based on behavior of biological ants. Pheromone laying and selection of shortest route with the help of pheromone inspired development of first ACO algorithm. Since, presentation of first such algorithm, many researchers have worked and published their research in this field. Though initial results were not so promising but recent developments have made this metaheuristic a significant algorithm in Swarm Intelligence. This research presents a brief overview of recent developments carried out in ACO algorithms in terms of both applications and algorithmic developments. For application developments, multi-objective optimization, continuous optimization and time-varying NP-hard problems have been presented. While to review articles based on algorithmic development, hybridization and parallel architectures have been investigated.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

55 extracted references · 55 canonical work pages

  1. [42]

    Analysis of the population-based ant colo ny optimization algo- rithm for the tsp and the qap

    Sabrina Oliveira, Mohamed Saifullah Hussin, Andrea Rol i, Marco Dorigo, and Thomas St¨ utzle. Analysis of the population-based ant colo ny optimization algo- rithm for the tsp and the qap. In Evolutionary Computation (CEC), 2017 IEEE Congress on , pages 1734–1741. IEEE, 2017

    work page 2017

  2. [43]

    Iterated greedy

    Thomas St¨ utzle and Rub´ en Ruiz. Iterated greedy. Handbook of Heuristics , pages 547–577, 2018

    work page 2018

  3. [45]

    Hybrid metaheuristics in combinatorial optimization: A survey

    Christian Blum, Jakob Puchinger, G¨ unther R Raidl, and A ndrea Roli. Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing , 11(6):4135–4151, 2011

    work page 2011

  4. [49]

    Modeling the dynam ics of ant colony optimization

    Daniel Merkle and Martin Middendorf. Modeling the dynam ics of ant colony optimization. Evolutionary Computation , 10(3):235–262, 2002

    work page 2002

  5. [40]

    The irace package: Iterated r acing for automatic algorithm configuration

    Manuel L´ opez-Ib´ a˜ nez, J´ er´ emie Dubois-Lacoste, Leslie P´ erez C´ aceres, Mauro Bi- rattari, and Thomas St¨ utzle. The irace package: Iterated r acing for automatic algorithm configuration. Operations Research Perspectives, 3:43–58, 2016

    work page 2016

  6. [39]

    A unified ant colony optimization algorithm for continuous op timization

    Tianjun Liao, Thomas St¨ utzle, Marco A Montes de Oca, and Marco Dorigo. A unified ant colony optimization algorithm for continuous op timization. European Journal of Operational Research , 234(3):597–609, 2014

    work page 2014

  7. [50]

    An efficient gpu implementation of ant colony optimization for the traveling salesman probl em

    Akihiro Uchida, Yasuaki Ito, and Koji Nakano. An efficient gpu implementation of ant colony optimization for the traveling salesman probl em. In Networking and computing (icnc), 2012 third international conference on , pages 94–102. IEEE, 2012

    work page 2012

  8. [1]

    The ant colony meta-heuristic in new ideas in optimiza- tion, 1999

    M Dorigo and G DiCaro. The ant colony meta-heuristic in new ideas in optimiza- tion, 1999

    work page 1999

Show all 55 references
  1. [2]

    Ant a lgorithms for discrete optimization

    Marco Dorigo, Gianni Di Caro, and Luca M Gambardella. Ant a lgorithms for discrete optimization. Artificial life , 5(2):137–172, 1999

    1999

  2. [3]

    Optimization, learning and natural algori thms

    Marco Dorigo. Optimization, learning and natural algori thms. PhD Thesis, Po- litecnico di Milano , 1992

    1992

  3. [4]

    Th e ant system: An auto- catalytic optimizing process

    Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni. Th e ant system: An auto- catalytic optimizing process. 1991

    1991

  4. [5]

    An t system: optimization by a colony of cooperating agents

    Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni. An t system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) , 26(1):29–41, 1996

    1996

  5. [6]

    The traveling salesman problem: a computational study

    Robert E Applegate, David L Bixby, Vasek Chvatal, and Will iam J Cook. The traveling salesman problem: a computational study . Princeton university press, 2006

    2006

  6. [7]

    The traveling salesman: computational solutions for TSP ap pli- cations

    Gerhard Reinelt. The traveling salesman: computational solutions for TSP ap pli- cations. Springer-Verlag, 1994

    1994

  7. [8]

    A n ant colony opti- mization algorithm for dna sequencing by hybridization

    Christian Blum, Mateu Y´ abar Vall` es, and Maria J Blesa. A n ant colony opti- mization algorithm for dna sequencing by hybridization. Computers & Operations Research, 35(11):3620–3635, 2008

    2008

  8. [9]

    Beam-acohybridizing ant colony optimiz ation with beam search: An application to open shop scheduling

    Christian Blum. Beam-acohybridizing ant colony optimiz ation with beam search: An application to open shop scheduling. Computers & Operations Research , 32(6):1565–1591, 2005

    2005

  9. [10]

    An ant c olony optimization approach to flexible protein–ligand docking

    Oliver Korb, Thomas St¨ utzle, and Thomas E Exner. An ant c olony optimization approach to flexible protein–ligand docking. Swarm Intelligence , 1(2):115–134, 2007

    2007

  10. [11]

    Beam-aco for simple assembly line balan cing

    Christian Blum. Beam-aco for simple assembly line balan cing. INFORMS Journal on Computing , 20(4):618–627, 2008

    2008

  11. [12]

    An ant colony sy stem hybridized with a new local search for the sequential ordering problem

    Luca Maria Gambardella and Marco Dorigo. An ant colony sy stem hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing , 12(3):237–255, 2000. Title Suppressed Due to Excessive Length 9

    2000

  12. [13]

    Antnet: Distributed sti gmergetic control for communications networks

    Gianni Di Caro and Marco Dorigo. Antnet: Distributed sti gmergetic control for communications networks. Journal of Artificial Intelligence Research , 9:317–365, 1998

    1998

  13. [14]

    An ant colony optimis ation algorithm for the 2d and 3d hydrophobic polar protein folding problem

    Alena Shmygelska and Holger H Hoos. An ant colony optimis ation algorithm for the 2d and 3d hydrophobic polar protein folding problem. BMC bioinformatics , 6(1):30, 2005

    2005

  14. [15]

    Spec ial issue on ant colony optimization

    Karl F Doerner, Daniel Merkle, and Thomas St¨ utzle. Spec ial issue on ant colony optimization. Swarm Intelligence , 3(1):1–2, 2009

    2009

  15. [16]

    The self- organizing exploratory pattern of the argentine ant

    J-L Deneubourg, Serge Aron, Simon Goss, and Jacques M Pas teels. The self- organizing exploratory pattern of the argentine ant. Journal of insect behavior , 3(2):159–168, 1990

    1990

  16. [17]

    M odulation of trail laying in the antlasius niger (hymenoptera: Formicidae) an d its role in the collective selection of a food source

    Ralph Beckers, Jean-Louis Deneubourg, and Simon Goss. M odulation of trail laying in the antlasius niger (hymenoptera: Formicidae) an d its role in the collective selection of a food source. Journal of Insect Behavior , 6(6):751–759, 1993

    1993

  17. [18]

    Ant-q: A reinforcem ent learning approach to the traveling salesman problem

    Luca M Gambardella and Marco Dorigo. Ant-q: A reinforcem ent learning approach to the traveling salesman problem. In Machine Learning Proceedings 1995 , pages 252–260. Elsevier, 1995

    1995

  18. [19]

    Ant colonies for th e traveling salesman problem

    M Dorrigo and Luca Maria Gambardella. Ant colonies for th e traveling salesman problem. in BioSystems , 1997

    1997

  19. [20]

    Improving the ant system: A detailed report on the max–min ant system

    Thomas St¨ utzle and Holger H Hoos. Improving the ant system: A detailed report on the max–min ant system. FG Intellektik, FB Informatik, TU Darmstadt, Germany, Tech. Rep. AIDA–96–12 , 1996

    1996

  20. [21]

    Max-min ant system and lo cal search for the traveling salesman problem

    Thomas Stutzle and Holger Hoos. Max-min ant system and lo cal search for the traveling salesman problem. In Evolutionary Computation, 1997., IEEE Interna- tional Conference on , pages 309–314. IEEE, 1997

    1997

  21. [22]

    A new rank based version of the ant system

    Bernd Bullnheimer, Richard F Hartl, and Christine Strau ss. A new rank based version of the ant system. a computational study. 1997

    1997

  22. [23]

    Exact and approximate nondetermini stic tree-search proce- dures for the quadratic assignment problem

    Vittorio Maniezzo. Exact and approximate nondetermini stic tree-search proce- dures for the quadratic assignment problem. INFORMS journal on computing , 11(4):358–369, 1999

    1999

  23. [24]

    Analysis of the best-worst ant system and its variants on the tsp

    Oscar Cord´ on Garc ´ ıa, I˜ naki Fern´ andez de Viana, and Francisco Herrera Triguero. Analysis of the best-worst ant system and its variants on the tsp. Mathware & soft computing. 2002 Vol. 9 N´ um. 2 [-3] , 2002

    2002

  24. [25]

    A new aco model integrating evolutionary computation conce pts: The best-worst ant system

    Oscar Cordon, Inaki Fern´ andez de Viana, Francisco Herr era, and Llanos Moreno. A new aco model integrating evolutionary computation conce pts: The best-worst ant system. 2000

    2000

  25. [26]

    A population bas ed approach for aco

    Michael Guntsch and Martin Middendorf. A population bas ed approach for aco. In Workshops on Applications of Evolutionary Computation , pages 72–81. Springer, 2002

    2002

  26. [27]

    Theoretical and practical aspects of ant colony optimizati on, vol- ume 282

    Christian Blum. Theoretical and practical aspects of ant colony optimizati on, vol- ume 282. IOS press, 2004

    2004

  27. [28]

    Hc–aco: T he hyper-cube frame- work for ant colony optimization

    Christian Blum, Andrea Roli, and Marco Dorigo. Hc–aco: T he hyper-cube frame- work for ant colony optimization. In Proceedings of MIC, volume 2, pages 399–403, 2001

    2001

  28. [29]

    Ant colony optimization with local search for dynamic traveling sales man problems

    Michalis Mavrovouniotis, Felipe M M¨ uller, and Shengxi ang Yang. Ant colony optimization with local search for dynamic traveling sales man problems. IEEE transactions on cybernetics , 47(7):1743–1756, 2017

    2017

  29. [30]

    Ant algor ithms with immigrants schemes for the dynamic vehicle routing problem

    Michalis Mavrovouniotis and Shengxiang Yang. Ant algor ithms with immigrants schemes for the dynamic vehicle routing problem. Information Sciences, 294:456– 477, 2015. 10 Aleem Akhtar

    2015

  30. [31]

    A survey of swarm intelligence for dynamic optimization: Algorithms and app lications

    Michalis Mavrovouniotis, Changhe Li, and Shengxiang Ya ng. A survey of swarm intelligence for dynamic optimization: Algorithms and app lications. Swarm and Evolutionary Computation , 33:1–17, 2017

    2017

  31. [32]

    Ant colony algorithms for the dynamic vehicle routing probl em with time windows

    Barry van Veen, Michael Emmerich, Zhiwei Yang, Thomas B¨ ack, and Joost Kok. Ant colony algorithms for the dynamic vehicle routing probl em with time windows. In International Work-Conference on the Interplay Between Na tural and Artificial Computation, pages 1–10. Springer, 2013

  32. [33]

    An experimental analysis of design choices of multi-objective ant colony optimization algori thms

    Manuel L´ opez-Ib´ a˜ nez and Thomas St¨ utzle. An experimental analysis of design choices of multi-objective ant colony optimization algori thms. Swarm Intelligence , 6(3):207–232, 2012

    2012

  33. [34]

    The automatic d esign of multiobjective ant colony optimization algorithms

    Manuel Lopez-Ibanez and Thomas Stutzle. The automatic d esign of multiobjective ant colony optimization algorithms. IEEE Transactions on Evolutionary Compu- tation, 16(6):861–875, 2012

    2012

  34. [35]

    A new indicator- based many-objective ant colony optimizer for continuous s earch spaces

    Jes´ us Guillermo Falc´ on-Cardona and Carlos A Coello Co ello. A new indicator- based many-objective ant colony optimizer for continuous s earch spaces. Swarm Intelligence, 11(1):71–100, 2017

    2017

  35. [36]

    An incremental ant colony algorithm with local sear ch for continuous opti- mization

    Tianjun Liao, Marco A Montes de Oca, Dogan Aydin, Thomas S t¨ utzle, and Marco Dorigo. An incremental ant colony algorithm with local sear ch for continuous opti- mization. In Proceedings of the 13th annual conference on Genetic and evo lutionary computation, pages 125–132. ACM, 2011

    2011

  36. [37]

    Enhancing iaco r local sea rch by mtsls1-bfgs for continuous global optimization

    Udit Kumar, Sumit Soman, et al. Enhancing iaco r local sea rch by mtsls1-bfgs for continuous global optimization. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation , pages 33–40. ACM, 2015

    2015

  37. [38]

    Ant colony optimization for continu ous domains

    Ping Guo and Lin Zhu. Ant colony optimization for continu ous domains. In Natural computation (ICNC), 2012 eighth international con ference on, pages 758–

    2012

  38. [41]

    Adaptive multimodal continuous ant colony op timization

    Qiang Yang, Wei-Neng Chen, Zhengtao Yu, Tianlong Gu, Yun Li, Huaxiang Zhang, and Jun Zhang. Adaptive multimodal continuous ant colony op timization. IEEE Transactions on Evolutionary Computation , 21(2):191–205, 2017

    2017

  39. [44]

    Ant colony optimization using exploratory ants for constructi ng partial solutions

    Akira Hara, Syuhei Matsushima, Takumi Ichimura, and Tet suyuki Takahama. Ant colony optimization using exploratory ants for constructi ng partial solutions. In Evolutionary Computation (CEC), 2010 IEEE Congress on , pages 1–7. IEEE, 2010

    2010

  40. [46]

    Ant colony optimization and constraint programming

    Christine Solnon. Ant colony optimization and constraint programming . John Wiley & Sons, 2013. Title Suppressed Due to Excessive Length 11

    2013

  41. [47]

    Pheromone-based heuristic column generation for vehicle routing problems w ith black box feasibil- ity

    Florence Massen, Yves Deville, and Pascal Van Hentenryc k. Pheromone-based heuristic column generation for vehicle routing problems w ith black box feasibil- ity. In International Conference on Integration of Artificial Inte lligence (AI) and Operations Research (OR) Techniques...

    2012

  42. [48]

    Exper- imental analysis of pheromone-based heuristic column gene ration using irace

    Florence Massen, Manuel L´ opez-Ib´ anez, Thomas St¨ utzle, and Yves Deville. Exper- imental analysis of pheromone-based heuristic column gene ration using irace. In International Workshop on Hybrid Metaheuristics , pages 92–106. Springer, 2013

    2013

  43. [51]

    An analysis of communication policies for homogeneou s multi-colony aco algorithms

    Colin Twomey, Thomas St¨ utzle, Marco Dorigo, Max Manfri n, and Mauro Birat- tari. An analysis of communication policies for homogeneou s multi-colony aco algorithms. Information Sciences, 180(12):2390–2404, 2010

    2010

  44. [52]

    Comparative evaluation of platforms f or parallel ant colony optimization

    Gin´ es D Guerrero, Jos´ e M Cecilia, Antonio Llanes, Jos´e M Garc ´ ıa, Martyn Amos, and Manuel Ujald´ on. Comparative evaluation of platforms f or parallel ant colony optimization. The Journal of Supercomputing , 69(1):318–329, 2014

    2014

  45. [53]

    Enhancing data parallelism for ant colony optimization on g pus

    Jos´ e M Cecilia, Jos´ e M Garc ´ ıa, Andy Nisbet, Martyn Amos, and Manuel Ujald´ on. Enhancing data parallelism for ant colony optimization on g pus. Journal of Parallel and Distributed Computing , 73(1):42–51, 2013

    2013

  46. [54]

    Improving ant colony o ptimization perfor- mance on the gpu using cuda

    Laurence Dawson and Iain Stewart. Improving ant colony o ptimization perfor- mance on the gpu using cuda. In Evolutionary Computation (CEC), 2013 IEEE Congress on , pages 1901–1908. IEEE, 2013

    2013

  47. [55]

    Parallel ant colony optimization on graphics processing units

    Audrey Del´ eVacq, Pierre Delisle, Marc Gravel, and Mich a¨ el Krajecki. Parallel ant colony optimization on graphics processing units. Journal of Parallel and Distributed Computing , 73(1):52–61, 2013

    2013

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.