Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing

We investigate the problem of scheduling a sequence of cars to be placed on an assembly line. Stations, along the assembly line install options (e.g. air conditioning), but have limited capacities, and hence cars requiring the same options need to be distributed far enough apart. The desired separation is not always feasible, leading to an optimisation problem that minimises the violation of the ideal separation requirements. In order to solve the problem, we use a large neighbourhood search (LNS) based on mixed integer programming (MIP). The search is implemented as a sliding window, by selecting overlapping subsequences of manageable sizes, which can be solved efficiently. Our experiments show that, with LNS, substantial improvements in solution quality can be found.

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

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

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

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

[5]  Parames Chutima,et al.  A multi-objective car sequencing problem on two-sided assembly lines , 2018, J. Intell. Manuf..

[6]  Andreas T. Ernst,et al.  A Lagrangian-ACO matheuristic for car sequencing , 2014, EURO J. Comput. Optim..

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

[8]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

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

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

[11]  Zhang Ping,et al.  Sliding window algorithm for aircraft landing problem , 2011, 2011 Chinese Control and Decision Conference (CCDC).

[12]  Esko Ukkonen,et al.  Fast scaffolding with small independent mixed integer programs , 2011, Bioinform..

[13]  Pascal Van Hentenryck,et al.  Constraint Satisfaction Using Constraint Logic Programming , 1992, Artif. Intell..

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

[15]  V. Isaeva.  Self-organization in biological systems , 2012, Biology Bulletin.

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

[17]  Matthias Prandtstetter,et al.  An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem , 2008, Eur. J. Oper. Res..

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

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

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

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

[22]  Gilbert Laporte,et al.  Iterated tabu search for the car sequencing problem , 2008, Eur. J. Oper. Res..

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

[24]  Celso C. Ribeiro,et al.  An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem , 2008, Eur. J. Oper. Res..

[25]  Xiangyang ZHANG,et al.  Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem , 2017 .

[26]  Eivind Jahren,et al.  A column generation approach and new bounds for the car sequencing problem , 2018, Ann. Oper. Res..

[27]  Hui Sun,et al.  Car sequencing for mixed-model assembly lines with consideration of changeover complexity , 2018 .