|
|||||
|
|
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows |
|
| Authors: | Louis-Martin Rousseau Michel Gendreau Gilles Pesant |
| Institution: | (1) Département informatique et recherche opérationnelle, University of Montreal, C.P. 6128 Succ. Centre-Ville, Montréal, Canada, H3C 3J7;;(2) Centre for Research on Transportation, University of Montreal, C.P. 6128 Succ. Centre-Ville, Montréal, Canada, H3C 3J7;(3) Département de génie électrique et de génie informatique, École Polytechnique de Montréal, C.P. 6079 Succ. Centre-Ville, Montréal, Canada, H3C 3A7; |
| Abstract: | 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. |
| Keywords: | constraint programming local search method metaheuristic hybrid method vehicle routing problem variable neighborhood descent combinatorial optimization |
| 本文献已被 SpringerLink 等数据库收录！ | |