A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem

摘要: In this paper we present a new method for solving large instances of the Car Sequencing Problem (CarSP) including constraints defined by assembly shop and paint shop. Especially latter are greater significance, since they allow no violations. Our approach combines general Variable Neighborhood Search with Integer Linear Programming (ILP) methods benefits from advantages both techniques. While two neighborhoods—Swapping Inserting—are adopted previous work, others based on ILP formulation CarSP, CPLEX is used as purpose solver identifying best solutions within these neighborhoods. The comparison results obtained during ROADEF Challenge 2005 shows that promising competitive. particular, were able to obtain some new, so far unknown instances.