A Lagrangian-ACO matheuristic for car sequencing

In this study, we investigate a hybrid Lagrangian relaxation ant colony optimisation for optimisation version of the car sequencing problem. Several cars are required to be scheduled on an assembly line and each car requires a number of options such as sunroof and/or air conditioning. These cars are required to be sequenced such that sub-sequences of specific sizes may only include a limited number of any option. While this is usually a hard constraint, in this study we treat it as a soft constraint and further require the utilisation of options be modulated across the sequence leading to the optimisation problem. We investigate various Lagrangian heuristics, ant colony optimisation (ACO) and hybrids of these methods. The results show that the Lagrangian-ACO hybrid is the best performing method for up to 300 cars.

[1]  Patrick Albert,et al.  CP with ACO , 2008, CPAIOR.

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

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

[4]  Jorge M. S. Valente,et al.  Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups , 2008, Comput. Oper. Res..

[5]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

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

[7]  Simona Sacone,et al.  Integer programming and ant colony optimization for planning intermodal freight transportation operations , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[8]  Eugene C. Freuder,et al.  Constraint satisfaction using constraint logic programming , 1994 .

[9]  Ian P. Gent.  Two Results on Car-sequencing Problems , 1998 .

[10]  Thomas Stützle,et al.  Ant Colony Optimization and Swarm Intelligence , 2008 .

[11]  Zhi-Gang Ren,et al.  Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem , 2012, Inf. Sci..

[12]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[13]  Christian Blum,et al.  Hybrid Metaheuristics, An Emerging Approach to Optimization , 2008, Hybrid Metaheuristics.

[14]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[15]  Günther R. Raidl,et al.  An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing , 2004, PPSN.

[16]  Márk Jelasity,et al.  An Ant Approach to Membership Overlay Design , 2004, ANTS Workshop.

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

[18]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[19]  Andreas T. Ernst,et al.  Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling , 2009, Hybrid Metaheuristics.

[20]  Andreas T. Ernst,et al.  Constraint-based ACO for a shared resource constrained scheduling problem , 2013 .

[21]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[22]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[23]  Jordi Pereira,et al.  A Beam Search approach for the optimization version of the Car Sequencing Problem , 2008, Ann. Oper. Res..

[24]  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..

[25]  Andreas T. Ernst,et al.  Car sequencing with constraint-based ACO , 2011, GECCO '11.

[26]  Waldo C. Kabat,et al.  Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem , 2004, Journal of Automated Reasoning.

[27]  Andreas T. Ernst,et al.  Integrating ACO and Constraint Propagation , 2004, ANTS Workshop.

[28]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

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

[30]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[31]  Andreas T. Ernst.  A hybrid Lagrangian Particle Swarm Optimization Algorithm for the degree-constrained minimum spanning tree problem , 2010, IEEE Congress on Evolutionary Computation.

[32]  David Abramson,et al.  High performance parametric modeling with Nimrod/G: killer application for the global grid? , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[33]  Andreas T. Ernst,et al.  Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows , 2009, EvoCOP.

[34]  Vittorio Maniezzo,et al.  Benders decomposition, Lagrangean relaxation and metaheuristic design , 2009, J. Heuristics.

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

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

[37]  Laurence A. Wolsey,et al.  Two “well-known” properties of subgradient optimization , 2009, Math. Program..

[38]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[39]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .