Solving real car sequencing problems with ant colony optimization

An automobile assembly line is usually configured as three successive shops in which the body is constructed, painted, and then assembled together with all component parts into a finished vehicle. However, many published production sequencing models ignore the first two shops and base their results only on the requirements and constraints of the assembly shop. In this article, we propose to more closely follow the actual industrial structure. We therefore first propose a single objective mathematical model for scheduling the paint and assembly shops. We then propose an ACO metaheuristic for solving a multiple-objective formulation. Data provided by Groupe Renault show that the proposed approach offers better solutions than those of current practice.

[1]  Ho-fung Leung,et al.  Performance of a Comprehensive and Efficient Constraint Library Based on Local Search , 1998, Australian Joint Conference on Artificial Intelligence.

[2]  Bruce Parrello,et al.  Car wars: (almost) birth of an expert system , 1988 .

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

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

[5]  Marimuthu Palaniswami,et al.  Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem , 1996 .

[6]  T. Ertay.  Simulation approach in comparison of a pull system in a cell production system with a push system in a conventional production system according to flexible cost: A case study , 1998 .

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

[8]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[9]  Marc Gravel,et al.  Algorithme D’optimisation Par Colonie De Fourmis Avec Matrices De Visibilité Multiples Pour La Résolution D’un Problème D’ordonnancement industriel , 2002 .

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

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

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

[13]  Marc Gravel,et al.  Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..

[14]  Toby Walsh,et al.  Proceedings of AAAI-96 , 1996 .

[15]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[16]  Richard B. Chase,et al.  Operations Management , 2019, CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide, 2nd Edition.

[17]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[18]  Andreas DrexlAlfKimms.  Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints , 2001 .

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

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

[21]  Marc Gravel,et al.  Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems , 2005, J. Oper. Res. Soc..

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