Optimization Research about the Time Window Based Transportation Routing Problem of Emergency Transportation

This paper is about the forbidding time window based on the vehicle routing problem in emergency transportation. Firstly, the research problem is defined where the road and nodes of traffic network both have a forbidding time window. The objective is to minimize the dispatch time through the path chosen, consider the combination property of model, and use dynamic programming and develop Label Algorithm to design the problem solving method. Lastly, an example is taken to show and illustrate the effectiveness of the algorithm.

• Record URL:
  https://doi.org/10.1061/41139(387)480
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784411391
• Supplemental Notes:
  • © 2010 American Society of Civil Engineers.
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Shuai, Bin
  • Chen, Gangtie
  • Tuo, Chao
• Conference:
  • International Conference of Logistics Engineering and Management (ICLEM) 2010
  • Location: Chengdu , China
  • Date: 2010-10-8 to 2010-10-10
• Publication Date: 2010-9

Language

• English

Media Info

• Media Type: Web
• Features: References;
• Pagination: pp 3438-3443
• Monograph Title: ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration

Subject/Index Terms

• TRT Terms: Algorithms; Dispatching; Emergency transportation; Optimization; Routing; Time windows
• Uncontrolled Terms: Vehicle routing problem
• Subject Areas: Highways; Planning and Forecasting; Security and Emergencies; I72: Traffic and Transport Planning; I90: Vehicles;

Filing Info

• Accession Number: 01525540
• Record Type: Publication
• ISBN: 9780784411391
• Files: TRIS, ASCE
• Created Date: May 28 2014 3:21PM