Classical Problems in TSL

From The Transportation Science & Logistics Society Wiki

Revision as of 12:47, 19 April 2007 by 66.32.255.241 (Talk)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)
Jump to: navigation, search
  • The Travelling Salesman Problem (TSP)
  • The Vehicle Routing Problem (VRP)

In the vehicle routing problem the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once.

G. Clarke and J. Wright. "Scheduling of vehicles from a central depot to a number of delivery points." Operations Research 12, 568-581, 1964.

  • The Pickup and Delivery Problem (PDP)
  • The Split Delivery Vehicle Routing Problem (SDVRP)

In the vehicle routing problem the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem the restriction that each customer is visited once is removed.

M. Dror and P. Trudeau. "Savings by split delivery routing." Transportation Science 23,141-145, 1989.

M. Dror and P. Trudeau. "Split delivery routing." Naval Research Logistics 37, 383-402, 1990.

C. Archetti, M.W.P. Savelsbergh, and M.G. Speranza. "Worst-Case Analysis of Split Delivery Routing Problems." Transportation Science 40, 226-234, 2006.

Retrieved from "http://www.castlelab.princeton.edu/wiki/index.php/Classical_Problems_in_TSL"