Very large-scale vehicle routing: new test problems, algorithms, and results

  • Authors:

  • Feiyue Li;Bruce Golden;Edward Wasil

  • Affiliations:

  • Department of Mathematics, University of Maryland, College Park, MD;R. H. Smith School of Business, University of Maryland, College Park, MD;Kogod School of Business, American University, Washington DC

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

The standard vehicle routing problem was introduced in the OR/MS literature about 45 years ago. Since then, the vehicle routing problem has attracted an enormous amount of research attention. In the late 1990s, large vehicle routing problem instances with nearly 500 customers were generated and solved using metaheuristics. In this paper, we focus on very large vehicle routing problems. Our contributions are threefold. First, we present problem instances with as many as 1200 customers along with estimated solutions. Second, we introduce the variable-length neighbor list as a tool to reduce the number of unproductive computations. Third, we apply record-to-record travel with a variable-length neighbor list to 32 problem instances and obtain high-quality solutions, very quickly.