Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route

The authors discuss problems with integrated routing and scheduling of hazardous materials transportation with time-of-day-related link duration, population exposure, and accident rate network variability. Subject to total trip duration constraint, the authors minimize risk (exposure multiplied by accident probability), and allow for stopping at network nodes. The authors propose pseudopolynomial dynamic programming algorithms for each of four increasingly more realistic waiting and driving period constraint versions of the problem. Algorithm experimentation was done with a realistic example network and the authors give examples of solutions generated. The algorithms are good candidates for decision-support system implementation because the computation effort required is reasonable. The circuitous behavior common in risk-minimizing routes are not exhibited by many of the model-generated routes. Taking full advantage of accident probability and exposure time-varying nature is possible through en route stops and route generation associated with much lower risk levels than those with no allowable waiting results.

  • Availability:
  • Authors:
    • Erkut, Erhan
    • Alp, Osman
  • Publication Date: 2007-2


  • English

Media Info

  • Media Type: Print
  • Features: Appendices; Figures; References; Tables;
  • Pagination: pp 107-122
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01049943
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 1 2007 4:28PM