Planning approximations to the length of TSP and VRP problems

This paper studies parsimonious, intuitive, and effective formulas to approximate the length of Traveling Salesman Problems (TSP) and Vehicle Routing Problems (VRP). Using intuition derived from continuous models and graph theory, a formula to approximate the length of vehicle routes is proposed. In instances with different patterns of customer spatial distribution, time windows, customer demands, and depot locations are used to test the proposed approximation. Regression results show that the approximation can reasonably predict the length of TSP and VRP problems in randomly generated problems and real urban networks. Expressions for the incremental cost of serving an additional customer or increasing the number of routes are derived and estimated. The main contribution of this paper is to develop and test intuitive approximations to TSP and VRP problem in general settings. The approximations are valuable for strategic and planning analysis of transportation and logistics problems. (a)

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/1832570X
• Authors:
  • FIGLIOZZI, M A
• Publication Date: 2007-3

Language

• English

Media Info

• Pagination: 29P
• Serial:
  • Institute of Transport and Logistics Studies Working Paper
  • Issue Number: ITLS-WP-07-03
  • Publisher: University of Sydney
  • ISSN: 1832-570X

Subject/Index Terms

• TRT Terms: Freight transportation; Itinerary; Logistics; Regression analysis; Vehicle miles of travel
• Uncontrolled Terms: Guidance
• ITRD Terms: 1112: Freight transport; 9104: Guidance; 699: Itinerary; 264: Logistics; 6588: Regression analysis; 292: Vehicle mile
• Subject Areas: Data and Information Technology; Freight Transportation; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01076015
• Record Type: Publication
• Source Agency: ARRB
• Files: ITRD, ATRI
• Created Date: Sep 18 2007 9:27AM