skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Library of Local Search Heuristics for the Vehicle Routing Problem

Abstract

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

Authors:
 [1];  [2];  [3]
  1. ORNL
  2. University of Maryland
  3. American University
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
979334
DOE Contract Number:  
DE-AC05-00OR22725
Resource Type:
Journal Article
Journal Name:
Mathematical Programming Computation
Additional Journal Information:
Journal Name: Mathematical Programming Computation
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; DESIGN; DISTRIBUTION; IMPLEMENTATION; OPTIMIZATION; ROUTING; combinatorial optimization; local search; heuristics; vehicle routing problem

Citation Formats

Groer, Christopher S, Golden, Bruce, and Edward, Wasil. A Library of Local Search Heuristics for the Vehicle Routing Problem. United States: N. p., 2010. Web. doi:10.1007/s12532-010-0013-5.
Groer, Christopher S, Golden, Bruce, & Edward, Wasil. A Library of Local Search Heuristics for the Vehicle Routing Problem. United States. https://doi.org/10.1007/s12532-010-0013-5
Groer, Christopher S, Golden, Bruce, and Edward, Wasil. 2010. "A Library of Local Search Heuristics for the Vehicle Routing Problem". United States. https://doi.org/10.1007/s12532-010-0013-5.
@article{osti_979334,
title = {A Library of Local Search Heuristics for the Vehicle Routing Problem},
author = {Groer, Christopher S and Golden, Bruce and Edward, Wasil},
abstractNote = {The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.},
doi = {10.1007/s12532-010-0013-5},
url = {https://www.osti.gov/biblio/979334}, journal = {Mathematical Programming Computation},
number = ,
volume = ,
place = {United States},
year = {Fri Jan 01 00:00:00 EST 2010},
month = {Fri Jan 01 00:00:00 EST 2010}
}