An Analysis of Optimization for Car PBS Scheduling Based on Greedy Strategy State Transition Algorithm

Abstract

The differences in constraints between an automotive painting workshop and a final assembly workshop can lead to production scheduling disruptions, and using the Painted Body Store (PBS) in automotive manufacturing can optimize production scheduling to meet the production requirements of the final assembly workshop. This is achieved by establishing a multi-objective mixed-integer optimization scheduling model for PBS and solving the model using a state transition algorithm based on the greedy strategy; finally, a comparison was made with the classical genetic algorithm. The results show that the optimal objective function is achieved when the body sequence movement iterations for data sets N and R are 34 and 54, respectively. At this point, the highest objective function scores are 23.46 and 49.79, and vehicles entering the PBS scheduling system from the painting-to-assembly line require 31 and 38 sequence adjustments, respectively. Compared with the classical genetic algorithm, the simulation results show that the state transition algorithm based on the greedy strategy is significantly better; it can also perform well in discrete sequence movement operations, demonstrating strong global search capabilities and fast convergence. It provides a new approach for optimizing vehicle scheduling in the automotive painting-to-assembly line.

Keywords

• automotive PBS scheduling
• vehicle sequencing
• multi-objective mixed-integer optimization
• greedy strategy
• state transition algorithm