A look-ahead addition to the ant colony optimization metaheuristic and its application to an industrial scheduling problem

Keywords

Metaheuristic, Ant colony optimization algorithms, Parallel metaheuristic, Mathematical optimization, Tabu search

References

• An ACO algorithm for the shortest common supersequence problemRené Michel, Martin Middendorf — 1999
• Optimization, Learning and Natural AlgorithmsMarco Dorigo — 1992
• An Ant Approach to the Flow Shop ProblemThomas Stützle — 1998
• Ant system for Job-shop SchedulingAlberto Colorni, Marco Dorigo, Vittorio Maniezzo — 1994
• A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup timesKeah Choon Tan — 2000
• Collective patterns and decision-makingJ. L. Deneubourg, Simon Goss — 1989
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristicMarc Gravel, Wilson L. Price, Caroline Gagné — 2002
• Probabilistic behaviour in ants: A strategy of errors?Jean‐Louis Deneubourg, Jacques M. Pasteéls, J.C. Verhaeghe — 1983
• The job shop scheduling problem: Conventional and new solution techniquesJacek Błażewicz, Wolfgang Domschke, Erwin Pesch — 1996
• Ant colonies for the travelling salesman problem.Marco Dorigo, Luca Maria Gambardella — 1997
• Distributed Optimization by Ant ColoniesAlberto Colorni, Marco Dorigo, Vittorio Maniezzo — 1992
• Ant system: optimization by a colony of cooperating agentsMarco Dorigo, Vittorio Maniezzo, A. Colorni — 1996

Cited by

• Ant colony optimization algorithm for the set covering problemKrzysztof Schiff — 2013
• A Hybrid Soft Computing Approach for Subset ProblemsBroderick Crawford, Ricardo Soto, Éric Monfroy — 2013
• An Ant-Based Solver for Subset ProblemsBroderick Crawford, Carlos Castro, Éric Monfroy — 2009
• A hybrid Ant algorithm for the set covering problemBroderick Crawford, Ricardo Soto, Éric Monfroy — 2011
• A New ACO Transition Rule for Set Partitioning and Covering ProblemsBroderick Crawford, Carlos Castro, Éric Monfroy — 2009
• Empirical Analysis of Randomness in Ant Colony Optimization Algorithms Applied to the Traveling Salesman ProblemS. Priya Velayudhan, Raymond R. Hill, Chaitr S. Hiremath — 2007
• A Two-Phase Set Partitioning Model for Passenger TransportationBroderick Crawford, Carlos Castro, Éric Monfroy — 2009
• Hybrid Approach to Crew Pairing OptimizationBroderick Crawford, Nibaldo Rodríguez, Carlos Castro — 2008
• Proceedings of the CP 2006 Doctoral ProgrammeZeynep Kiziltan, Brahim Hnich — 2006
• An ant-based solver for subset problemsBroderick Crawford, Carlos Castro, Éric Monfroy — 2009

Related papers

• Backjump-based backtracking for constraint satisfaction problemsRina Dechter, Daniel Frost — 2002
• A new version of ant system for subset problemsGuillermo Leguizamón, Zbigniew Michalewicz — 1999
• Principles of constraint programmingKrzysztof R. Apt — 2003
• Constraint Handling in Genetic Algorithms: The Set Partitioning ProblemP.C. Chu, J. E. Beasley — 1998
• Ant colony system: a cooperative learning approach to the traveling salesman problemMarco Dorigo, Luca Maria Gambardella — 1997
• OR-Library: Distributing Test Problems by Electronic MailJ. E. Beasley — 1990