Journal of Heuristics

, Volume 10, Issue 6, pp 613–627 | Cite as

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Article

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.

Metaheuristic Variable Neighborhood Search VNS Multi Depot Vehicle Routing Problem with Time Windows MDVRPTW 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, Inc. 2004

Authors and Affiliations

  1. 1.Department of Production and Operations Management, Institute of Management ScienceUniversity of ViennaViennaAustria
  2. 2.Institute for Operations ResearchETH ZurichZurichSwitzerland

Personalised recommendations