Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization

The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algorithm for solving this problem, and we introduce two different pheromone structures for this algorithm: the first pheromone structure aims at learning for "good" sequences of cars, whereas the second pheromone structure aims at learning for "critical" cars. We experimentally compare these two pheromone structures, that have complementary performances, and show that their combination allows ants to solve very quickly most instances.

[1]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2]  Pascal Van Hentenryck,et al.  A constraint-based architecture for local search , 2002, OOPSLA '02.

[3]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

[4]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[5]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[6]  Christine Solnon,et al.  A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems , 2006, EvoCOP.

[7]  Christine Solnon.  Boosting ACO with a Preprocessing Step , 2002, EvoWorkshops.

[8]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[9]  Christine Solnon,et al.  The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem , 2008, Eur. J. Oper. Res..

[10]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[11]  Pascal Van Hentenryck,et al.  Solving the Car-Sequencing Problem in Constraint Logic Programming , 1988, ECAI.

[12]  Christine Solnon,et al.  A study of ACO capabilities for solving the maximum clique problem , 2006, J. Heuristics.

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Marc Gravel,et al.  Review and comparison of three methods for the solution of the car sequencing problem , 2005, J. Oper. Res. Soc..

[15]  Fred W. Glover,et al.  ID Walk: A Candidate List Strategy with a Simple Diversification Device , 2004, CP.

[16]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[17]  Jens Gottlieb,et al.  Solving Car Sequencing Problems by Local Optimization , 2002, EvoWorkshops.

[18]  Christine Solnon,et al.  A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems , 2003, EvoWorkshops.

[19]  Jeng-Shyang Pan,et al.  Ant colony system with communication strategies , 2004, Inf. Sci..

[20]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[21]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[22]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[23]  Jean-Charles Régin,et al.  A Filtering Algorithm for Global Sequencing Constraints , 1997, CP.

[24]  Bertrand Estellon,et al.  Ordonnancement de véhicules: une approche par recherche locale à grand voisinage , 2005 .

[25]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[26]  Laurent Perron,et al.  Combining Forces to Solve the Car Sequencing Problem , 2004, CPAIOR.

[27]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[28]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[29]  Bernd Freisleben,et al.  Fitness landscapes and memetic algorithm design , 1999 .

[30]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[31]  Christine Solnon,et al.  Solving Permutation Constraint Satisfaction Problems with Artificial Ants , 2000, ECAI.

[32]  Tamás Kis,et al.  On the complexity of the car sequencing problem , 2004, Oper. Res. Lett..

[33]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[34]  Van-Dat Cung,et al.  Le problème du Car Sequencing RENAULT et le Challenge ROADEF'2005 , 2005 .

[35]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[36]  Edward P. K. Tsang,et al.  Tackling Car Sequencing Problems Using a Generic Genetic Algorithm , 1995, Evolutionary Computation.

[37]  Marcus Randall,et al.  Anti-pheromone as a Tool for Better Exploration of Search Space , 2002, Ant Algorithms.

[38]  Christine Solnon,et al.  Ant Algorithm for the Graph Matching Problem , 2005, EvoCOP.

[39]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[40]  Andrew J. Davenport,et al.  Solving constraint satisfaction sequencing problems by iterative repair , 2001 .

[41]  Daniel Merkle,et al.  Bi-Criterion Optimization with Multi Colony Ant Algorithms , 2001, EMO.

[42]  Bertrand Estellon,et al.  Two local search approaches for solving real-life car sequencing problems , 2008, Eur. J. Oper. Res..