Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint programming which allow an efficient search of such neighborhoods. The advantages of using a large neighborhood are not only the increased probability of finding a better solution at each iteration but also the reduction of the need to invoke specially-designed methods to avoid local minima. These operators are combined in a variable neighborhood descent in order to take advantage of the different neighborhood structures they generate. Key Words: constraint programming, local search method, metaheuristic, hybrid method, vehicle routing problem, variable neighborhood descent, combinatorial optimization

• Type: Journal
• Year: 2002
• Where: HEURISTICS
• Authors: Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant
• Keywords: Constraint Programming, HEURISTICS 2002, Large Neighborhood, Neighborhood Descent