Identifying geographically diverse routes for the transportation of hazardous materials

Transportation Research Part E: Logistics and Transportation Review

Volumn 44, Issue 3, 2008, Pages 333-349

  Dadkar, Yashoda ^a   Jones, Dean ^b   Nozick, Linda ^a  

^a Cornell University   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Genetic algorithm; Hazardous materials; K shortest path problem; Routing; Stochastic dynamic network

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; GRAPH THEORY; HAZARDOUS MATERIALS; HAZARDS; INTEGER PROGRAMMING; MATERIALS HANDLING; ROUTING ALGORITHMS; STOCHASTIC SYSTEMS; TRANSPORTATION ROUTES;

HIGHWAY FACILITIES; K SHORT PATH PROBLEM; K SHORTEST PATH; K-SHORTEST PATH ALGORITHMS; PERFORMANCE; ROUTINGS; SECURITY MEASURE; SHORTEST PATH PROBLEM; STOCHASTIC DYNAMIC NETWORKS; STOCHASTICS;

GENETIC ALGORITHMS;

ALGORITHM; HAZARDOUS WASTE; MODELING; PERFORMANCE ASSESSMENT; ROUTING; STOCHASTICITY; TRADE-OFF;

EID: 38649085368     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2006.10.010     Document Type: Article

References (21)

1. Akgün V., Erkut E., and Batta R. On finding dissimilar paths. European Journal of Operational Research 121 (2000) 232-246
2. Carotenuto P., Galiano G., and Giordani S. A metaheuristic approach for hazardous materials transportation. In: Fahrion R., Oswald M., and Reinelt G. (Eds). Operations Research Proceedings OR 2003 (2004), Springer, Berlin 119-126
3. Carotenuto P., Giordani S., and Ricciardelli S. Finding minimum equitable risk routes for hazmat shipment. Computers Operations Research 34 (2007) 1304-1327
4. Chang T., Nozick L.K., and Turnquist M.A. Multi-objective path finding in stochastic dynamic networks. Transportation Science 39 (2005) 383-399
5. Current J., and Marsh M. Multi-objective transportation network design: taxonomy annotation. European Journal of Operational Research 65 (1993) 4-19
6. Erkut E., and Ingolfsson A. Catastrophe avoidance models for hazardous materials route planning. Transportation Science 34 (2000) 165-179
7. Erkut E., and Verter V. Modeling of transport risk for hazardous materials. Operations Research 46 (1998) 625-642
8. Erkut, E., Tjandra, S., Verter, V., 2006. Hazardous materials transportation. In: Barnhart, C., Laporte, G. (Eds.), Handbooks in Operations Research & Management Science: Transportation, vol. 14.
9. Gopalan R., Kolluri K., Batta R., and Karwan M. Modeling equity of risk in the transportation of hazardous materials. Operations Research 38 (1990) 961-973
10. Harwood D.W., Viner J.G., and Russell E.R. Procedure for developing truck accident release rates for hazmat routing. Journal of Transportation Engineering 119 (1993) 189-199
11. He, R., Liu, H., Kornhauser, A., Ran., B., 2002. Study travel time variability from probe vehicle data. In: Proceedings of the 7th International Conference on Applications of Advanced Technology in Transportation, Cambridge, MA, pp. 16-23.
12. Kuby M., Zhongyi X., and Xiaodong X. A minimax method for finding the k best differentiated paths. Geographical Analysis 29 (1997) 298-313
13. Linder-Dutton L., Batta R., and Karwan M. Equitable sequencing of a given set of hazardous materials shipments. Transportation Science 25 (1991) 124-137
14. List G., Mirchandani P.B., Turnquist M.A., and Zografos K.G. Modeling analysis for hazardous materials transportation: risk analysis, routing/scheduling, facility location. Transportation Science 25 (1991) 146-156
15. Nembhard, D.A., 1994. Heuristic path selection in graphs with non-order preserving reward structure, Ph.D. dissertation, The University of Michigan, Ann Arbor, MI.
16. New York State Department of Transportation, 1982. Estimation of current traffic, Internal Memorandum, Albany, NY.
17. Nielsen, L.R., Pretolani, D., Andersen K.A., 2005. K-shortest paths in stochastic time-dependent networks. Working Paper.
18. Nozick L.K., List G.F., and Turnquist M.A. Integrated routing scheduling in hazardous materials transportation. Transportation Science 31 (1997) 200-215
19. Thyagarajan K., Batta R., Karwan M., and Szczerba R.J. Planning for dissimilar paths for military units. Military Operations Research 10 (2005) 25-41
20. Tittemore, L.H., Birdsall, M.R., Hill, D.M., Hammond, R.H., 1972. An analysis of urban area travel by time of day, report FH-11-7519, US Department of Transportation, Federal Highway Administration, Washington DC.
21. Yen J.Y. Finding the K shortest loopless paths in a network. Management Science 17 (1971) 712-716