Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route

References

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