A Decomposition Algorithm for Dynamic Car Sequencing Problems with Buffers

Abstract

In this paper, we research the dynamic car sequencing problem with car body buffer (DCSPwB) in automotive mixed-flow assembly. The objective is to reorder the sequence of cars in the paint shop using the post-painted body buffers to minimize the violation of constraint rules and the time cost of sequencing in the general assembly shop. We establish a mathematical model of DCSPwB and propose a decomposition-based algorithm based on the dynamic genetic algorithm (DGA) and greedy algorithm for delayed car release (PGDA). Experiments are conducted based on production orders from actual companies, and the results are compared with the solution results of the underlying genetic algorithm (GA) and greedy algorithm (GDA) to verify the effectiveness of the algorithm. In addition, the effect of buffer capacity on DCSPwB is investigated.

Keywords

• mixed-flow assembly
• car sorting
• decomposition algorithm
• genetic algorithm
• greedy algorithm