Integrated routing and scheduling of hazmat trucks with stops en route

Transportation Science

Volumn 41, Issue 1, 2007, Pages 107-122

  Erkut, Erhan ^a   Alp, Osman ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Dynamic programming; Hazardous materials; Routing and scheduling

Indexed keywords

ACCIDENT PREVENTION; ALGORITHMS; DECISION SUPPORT SYSTEMS; DYNAMIC PROGRAMMING; HAZARDOUS MATERIALS; INTEGRATED CONTROL; SCHEDULING;

ACCIDENT PROBABILITY; LINK DURATIONS; POPULATION EXPOSURE; PSEUDOPOLYNOMIAL DYNAMIC PROGRAMMING;

TRANSPORTATION ROUTES;

EID: 34247526971     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1060.0176     Document Type: Article

References (18)

1. Aneja, Y. P., K. P. K. Nair. 1978. Constrained shortest path problem. Naval Res. Logist. 25 549-555.
2. Cai, X., T. Kloks, C. K. Wong. 1997. Time-varying shortest path problems with constraints. Networks 29 141-149.
3. Cooke, K. L., E. Halsey. 1966. The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14 493-498.
4. Cox, R. G. 1984. Routing and scheduling of hazardous materials shipments: Algorithmic approaches to managing spent nuclear fuel transport. Unpublished doctoral dissertation, Cornell University, Ithaca, NY.
5. Current, J., M. Marsh. 1993. Multi-objective transportation network design and routing problems: Taxonomy and annotation. Eur. J. Oper. Res. 65 4-19.
6. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science: Network Routing, Vol. 8. North-Holland, Amsterdam, 35-139.
7. Erkut, E., O. Alp. 2005. Integrated routing and scheduling of hazmat trucks with stops en-route. Technical report, Department of Industrial Engineering, Bilkent University, Ankara, Turkey.
8. Erkut, E., V. Verter. 1995. Hazardous materials logistics. Zvi Drezner, ed. Facility Location: A Survey of Applications Methods, Vol. 20. Springer-Verlag, 467-506.
9. Federal Motor Carrier Safety Administration, U.S. Department of Transportation. 2004. Revised hours of service regulations, http://www.fmcsa. dot.gov/Home_Files/revised_hos.asp
10. Gamache, M., F. Soumis, G. Marquis, J. Desrosiers. 1999. A column generation approach for large-scale aircrew rostering problems. Oper. Res. 47 247-263.
11. Halpern, J. 1977. Shortest route with time dependent length of edges and limited delay possibilities in nodes. Zeitschrift Oper. Res. 21 117-124.
12. Handler, G. Y., I. Zang. 1980. A dual algorithm for the constrained shortest-path problem. Networks 10 293-310.
13. Joksch, H. C. 1966. The shortest route problem with constraints. J. Math. Anal. Appl. 14 191-197.
14. List, G. F., P. B. Mirchandani, M. A. Turnquist, K. G. Zografos. 1991. Modeling and analysis for hazardous materials transportation: Risk analysis, routing/scheduling, and facility location. Transportation Sci. 25 100-114.
15. Nozick, L. K., G. F. List, M. A. Turnquist. 1997. Integrated routing and scheduling in hazardous materials transportation. Transportation Sci. 31 200-215.
16. Orda, A., R. Rom. 1991. Minimum weight paths in time-dependent networks. Networks 21 295-319.
17. Ribeiro, C. C., M. Minoux. 1985. A heuristic approach to hard constrained shortest-path problems. Discrete Appl. Math. 10125-137.
18. Warburton, A. 1987. Approximation of Pareto optima in multiobjective shortest path problems. Oper. Res. 35 70-79.