publication . Other literature type . Article . 2007

The open vehicle routing problem: Algorithms, large-scale test problems, and computational results

Edward Wasil; Bruce L. Golden; Feiyue Li;
Restricted
  • Published: 01 Oct 2007
  • Publisher: Elsevier BV
Abstract
In the open vehicle routing problem (OVRP), a vehicle does not return to the depot after servicing the last customer on a route. The description of this variant of the standard vehicle routing problem appeared in the literature over 20 years ago, but has just recently attracted the attention of practitioners and researchers. Today, the OVRP is encountered in practice in the home delivery of packages and newspapers. Contractors who are not employees of the delivery company use their own vehicles and do not return to the depot. In the last five years, tabu search, deterministic annealing, and large neighborhood search have been applied to the OVRP with some succes...
Subjects
free text keywords: Test set, Operations research, Vehicle routing problem, Neighborhood search, Scale test, Tabu search, Heuristics, Large neighborhood search, Deterministic annealing, Algorithm, Computer science
Any information missing or wrong?Report an Issue