Optimization of Painting Car Sequence Based on Variable Neighborhood Search Algorithm
摘要
Car sequence optimization refers to the rearrangement of work-in-process sequences on the production line using a stereo warehouse. This paper focuses on solving the disordered car sequence issue in the painting production process, and uses the variable neighborhood search method to find the optimal solution, thereby reordering the sequence of car body entry and exit. It aims to improve overall assembly realization rate while reducing color changes in the painting workshop and balancing point repair workloads. Plant simulation is used for simulation verification, and tests show that this VNS algorithm can effectively reduce production delays caused by incorrect car sequencing, significantly improving coordination efficiency between the painting line and assembly line.