Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Production and Operations Management, Institute of Management Science, University of Vienna, A-1210, Vienna, Austria

    Michael Polacek, Richard F. Hartl & Karl Doerner

  2. Institute for Operations Research, ETH Zurich, CH-8092, Zurich, Switzerland

    Marc Reimann

Authors
  1. Michael Polacek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karl Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marc Reimann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Michael Polacek, Richard F. Hartl, Karl Doerner or Marc Reimann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Polacek, M., Hartl, R., Doerner, K. et al. A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. J Heuristics 10, 613–627 (2004). https://doi.org/10.1007/s10732-005-5432-5

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-005-5432-5

Search

Navigation