A Heuristic Approach for Car Sequencing Problem Including Assembly Ratio and Color Constraints

Abstract

A car factory contains three main workshops; body shop, paint shop and assembly shop. Each of these three workshops has their set of constraints which have to be met in a production day by arranging the vehicles. The car sequencing problem is used to create a production sequence that meets these constraints. Car sequencing problem first handled in the literature by optimization of assembly constraints including ratio constraints. After that, color constraints are integrated to assembly constraints. At this chapter, the scenario in which high priority ratio constraints are primary, color constraints are secondary is tackled and a heuristic approach is proposed. For optimization of ratio constraints, an initial algorithm based on the greedy algorithm is used. The developed algorithm is coded and used on data set which is proposed by Renault at the ROADEF'2005 challenge. According to results, it is achieved the range of results which is achieved by ROADEF finalists.