Multiobjective Vehicle Routing and Scheduling Problem with Time Window Constraints in Hazardous Material Transportation
This article has a reply.
VIEW THE REPLYPublication: Journal of Transportation Engineering
Volume 131, Issue 9
Abstract
This paper proposes a novel vehicle routing and scheduling problem in transporting hazardous materials for networks with multiple time-varying attributes. It actually aims to identify all nondominated time-varying paths with departure times at the origin and waiting times at intermediate nodes along these paths for a given pair of origin and destination, subject to three kinds of practical constraints: Limited operational time period, and service, and waiting time window constraints at a node. Based on the assumption of linear waiting attributes at a node, the proposed problem can be equivalently transformed into a static multiobjective shortest path problem in an acyclic network reconstructed by the space-time network technique. An efficient dynamic programming method is then developed. In addition, two numerical examples and a case study are carried out to demonstrate the methodology proposed in this paper.
Get full access to this article
View all available purchase options and get full access to this article.
References
Abkowtiz, M., Eiger, A., and Sirinivasan, S. (1984). “Estimating the release rates and costs of transporting hazardous waste.” Transportation Research Record 977, Transportation Research Board, Washington, D.C., 22–30.
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Prentice-Hall, Englewood Cliffs, N.J.
Cai, X., Kloks, T., and Wong, C. K. (1997). “Time-varying shortest path problems with time constraints.” Network, 29, 141–149.
Chang, G-L., Mahmassani, H. S., and Engquist, M. L. (1989). “System-optimal trip scheduling and routing in commuting networks.” Transportation Research Record 1989, Transportation Research Board, Washington, D.C., 54–65.
Cox, R. G. (1984). “Routing and scheduling of hazardous materials shipments: Algorithmic approaches to managing spent nuclear fuel transport.” PhD dissertation, Cornell Univ., Ithaca, N.Y.
Cox, R. G., and Turnquist, M. A. (1986). “Scheduling truck shipments of hazardous materials in the presence of curfews.” Transportation Research Record 1063, Transportation Research Board, Washington, D.C., 21–26.
Desaulniers, G., and Villeneuve, D. (2000). “The shortest path problem with time windows and linear waiting costs.” Transp. Sci., 34, 312–319.
Erkut, E., and Verter, V. (1995). “Hazardous materials logistics.” Facility location: A survey of application and methods, Z. Drezner, ed., Springer, New York, 466–506.
Federal Highway Administration (FHWA). (1994). “Guidelines for applying criteria to designate routes for transporting hazardous materials.” Rep. No. FHWA-SA-94-083, United States Department of Transportation, Washington, D.C.
Iakovou, E. T., Douligeris, C., Ip, C., Liu, H., and Yudhbir, L. (1999). “A maritime global route planning model for hazardous materials transportation.” Transp. Sci., 33, 34–48.
List, G. F., Mirchandani, P. B., Turnquist, M. A., and Zografos, K. G. (1991). “Modeling and analysis for hazardous materials transportation: risk analysis, routing/scheduling and facility location.” Transp. Sci., 25, 100–114.
Miller-Hooks, E., and Mahmassani, H. S. (1998). “Optimal routing of hazardous materials in stochastic, time-varying transportation networks.” Transportation Research Record 1645, Transportation Research Board, Washington, D.C., 143–151.
Nozick, L. K., List, G. F., and Turnquist, M. A. (1997). “Integrated routing and scheduling in hazardous materials transportation.” Transp. Sci., 31, 200–215.
Singapore Department of Statistics. (2001). “Household and housing.” ⟨http://www.singstat.gov.sg/keystats/people.html⟩.
Sulijoadikusumo, G. S., and Nozick, L. K. (1998). “Multiobjective routing and scheduling of hazardous materials shipments.” Transportation Research Record 1613, Transportation Research Board, Washington, D.C., 96–104.
Toth, P., and Vigo, D. (2002). The vehicle routing problem, SIAM Society for Industrial and Applied Mathematics, Philadelphia.
Turnquist, M. A. (1987). “Routes, schedules, and risks in transporting hazardous materials.” Strategic planning in energy and natural resources, B. Lev, J. A. Bloom, A. J. Gleit, F. H. Murphy, and C. Shoemaker, eds., Elsevier Science, Amsterdam, 289–302.
Wijeratne, A. B., Turnquist, M. A., and Mirchandani, P. B. (1993). “Multiobjective routing of hazardous materials in stochastic networks.” Eur. J. Oper. Res., 65, 33–43.
Ziliaskopoulos, A., and Mahmassani, H. S. (1993). “Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications.” Transportation Research Record 1408, Transportation Research Board, Washington, D.C., 94–100.
Zografos, K. G., and Androutsopoulos, K. N., (2002). “Heuristic algorithms for solving hazardous materials logistics problems.” Transportation Research Record 1783, Transportation Research Board, Washington, D.C., 158–166.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 131 • Issue 9 • September 2005
Pages: 699 - 707
Copyright
© 2005 ASCE.
History
Received: May 13, 2003
Accepted: Dec 28, 2004
Published online: Sep 1, 2005
Published in print: Sep 2005
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.