A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows |
| |
| Authors: | Michael Polacek Richard F Hartl Karl Doerner and Marc Reimann |
| |
| Institution: | (1) Department of Production and Operations Management, Institute of Management Science, University of Vienna, A-1210, Vienna, Austria;(2) Institute for Operations Research, ETH Zurich, CH-8092, Zurich, Switzerland |
| |
| Abstract: | The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. |
| |
| Keywords: | Metaheuristic Variable Neighborhood Search VNS Multi Depot Vehicle Routing Problem with Time Windows MDVRPTW |
| 本文献已被 SpringerLink 等数据库收录！ |
|
