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.
car sequencing problem ant colony optimization integer linear programming