Solving the Car Sequencing Problem with Considering Unexpected Supply Disturbances

This paper treats the car sequencing problem in final assembly line considering the unexpected occurrence of parts supply disturbance. In this regard, a basic integer linear programming model is developed using GAMS software and based on that, problem solving algorithm according to a reactive approach with considering supply disturbance occurrence is presented. Considering NP-hardness of the problem, a metaheuristic approach based on variable neighborhood search algorithm has been presented. For evaluating the proposed method, sample problems in CSPLib have been used and for simulating the supply disturbance occurrence, test problems in 3 sizes of small, medium and large have been designed. The obtained results show the high performance of proposed algorithm with respect to the best existing solution in all three categories of the problem.