Modeling and solving variants of the vehicle routing problem : algorithms, test problems, and computational results

In the standard version of the capacitated vehicle routing problem (VRP), a sequence of deliveries is generated for each vehicle in a homogeneous fleet based at a single depot so that all customers are serviced and the total distance traveled by the fleet is minimized. Each vehicle has a fixed capacity and must leave from and return to the depot. Each vehicle might have a route-length restriction that limits the maximum distance it can travel. Each customer has a known demand and is serviced by exactly one visit of a single vehicle. For more than 45 years, the standard VRP has attracted an enormous amount of attention in the operations research literature. There are many practical applications of vehicle routing in the distribution of products such as soft drinks, newspapers, groceries, and milk and in street sweeping, solid waste collection,and mail delivery. In this dissertation, we model and solve variants of the standard VRP. First, we focus on very large VRPs.


  • English

Media Info

  • Features: Bibliography; Maps;
  • Pagination: xiii, 629 p.

Subject/Index Terms

Filing Info

  • Accession Number: 01094571
  • Record Type: Publication
  • Source Agency: Northwestern University, Evanston
  • Report/Paper Numbers: 31-83540 UMI
  • Files: TLIB
  • Created Date: Apr 24 2008 8:28PM