Solving the bicriterion routing and scheduling problem for hazardous materials distribution

Transportation Research Part C: Emerging Technologies

Volumn 18, Issue 5, 2010, Pages 713-726

  Androutsopoulos, Konstantinos N ^a   Zografos, Konstantinos G ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Dynamic programming; Hazardous materials transportation; K Shortest path; Multiple criteria analysis; Routing

Indexed keywords

DYNAMIC PROGRAMMING; HAZARDOUS MATERIALS; HAZARDS; RISK PERCEPTION; SCHEDULING;

ALTERNATIVE ALGORITHMS; HAZARDOUS MATERIALS TRANSPORTATION; K SHORTEST PATH; MULTIPLE CRITERIA ANALYSIS; NONDOMINATED SOLUTIONS; ROUTING; ROUTING AND SCHEDULING; TRANSPORTATION NETWORK;

MATERIALS HANDLING;

ALGORITHM; MULTICRITERIA ANALYSIS; NUMERICAL METHOD; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

EID: 77953359013     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2009.12.002     Document Type: Article

References (41)

1. Abkowitz M., Cheng P.D., Lepofsky M. Use of geographic information systems in managing hazardous materials shipments. Transportation Research Record 1990, 1497:35-43.
2. Ahuja R., Magnanti T., Orlin B. Network flows: Theory, Algorithms, and Applications 1993, Prentice Hall, New Jersey.
3. Ahuja R.K., Orlin J.B., Pallottino S., Scutellà M.G. Dynamic shortest paths minimizing travel times and costs. Networks 2003, 41:197-205.
4. Androutsopoulos K.N., Zografos K.G. Solving the k-shortest path problem with time windows in a time varying network. Operations Research Letters 2008, 36(6):692-695.
5. Avella P., Boccia M., Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research 2004, 152:170-179.
6. Batta R., Chiu S.S. Optimal obnoxious paths on a network: transportation of hazardous materials. Operations Research 1988, 36:84-92.
7. Brown G., Ellis C.J., Graves G.W., Ronen D. Real-time, wide area dispatch of mobil tank trucks. Interfaces 1987, 17:107-120.
8. Brown G., Graves G.W. Real-time dispatch of petroleum tank trucks. Management Science 1981, 27(1):19-32.
9. Cai X., Kloks T., Wong C.K. Time-varying shortest path problems with constraints. Networks 1997, 29(3):141-149.
10. Caramia M., Dell'Olmo P., Gentili M., Mirchandani P.B. Delivery itineraries and distribution capacity of a freight network with time slots. Computers and Operations Research 2007, 34(6):1585-1600.
11. Chabini I. Discrete dynamic shortest path problems in transportation applications. Transportation Research Record: Journal of the Transportation Research Board 1998, 1645:170-175.
12. Chang T.-S., Nozick L.K., Turnquist M.A. Multiobjective path finding in stochastic dynamic networks with application to routing hazardous materials shipments. Transportation Science 2005, 39(3):383-399.
13. Chen Y.L., Rinks D., Tang K. The first K minimum cost paths in a time-schedule network. Journal of the Operational Research Society 2001, 52:102-108.
14. Chen Y.L., Tang K. Minimum time paths in a network with mixed time constraints. Computers and Operations Research 1998, 25(10):793-805.
15. Climaco J.C.N., Martins E.Q.V. A bicriterion shortest path algorithm. European Journal of Operational Research 1982, 11:399-404.
16. Cooke K.L., Halsey E. The shortest route through a network with time-dependent intermodal transit times. Journal of Mathematical Analysis and Applications 1966, 14:493-498.
17. Cox, G., 1984. Routing and Scheduling of Hazardous Materials Shipments: Algorithmic Approaches to Managing Spent Nuclear Fuel Transport. Ph.D. Thesis, Cornell University, Ithaca, NY.
18. Cox R.G., Turnquist M.A. Scheduling truck shipments of hazardous materials in the presence of curfews. Transportation Research Record 1986, 1063:21-26.
19. Eppstein D. Finding the k shortest paths. SIAM J Computing 1998, 28(2):652-673.
20. Erkut E., Ingolfsson A. Catastrophe avoidance models for hazardous materials route planning. Transportation Science 2000, 34(2):165-179.
21. Erkut E., Alp O. Integrated routing and scheduling of hazmat trucks with stops en route. Transportation Science 2007, 41(1):107-122.
22. Erkut, E., Tjandra, S., Verter, V., 2007. Hazardous materials transportation. In: Barnhart, Cynthia, Laporte, Gilbert (Eds.), Handbooks of Operational Research and Management Science, vol. 14. pp. 539-621.
23. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, W.H. Freeman, San Francisco.
24. Hadjiconstantinou E., Christofides N. An efficient implementation of an algorithm for finding K shortest simple paths. Networks 1999, 34(2):88-101.
25. Hall R.W. The fastest path through a network with random time-dependent travel times. Transportation Science 1986, 20(3):182-188.
26. Hansen P. Bicriterion path problems. Multiple Criteria Decision Making: Theory and Applications, Lecture Notes in Economics and Mathematical Systems 1980, vol. 177:109-127. Springer, Heidelberg.
27. Hamacher H.W., Ruzika S., Tjandra S.A. Algorithms for time-dependent bicriteria shortest path problems. Discrete Optimization 2006, 3:238-254.
28. Katoh N., Ibaraki T., Mine H. Efficient algorithm for k-shortest simple paths. Networks 1982, 12(4):411-427.
29. List G., Mirchandani P.B., Turnquist M.A., Zografos K.G. Modelling and analysis for hazardous materials transportation: risk analysis, routing/scheduling and facility location. Transportation Science 1991, 25(2):100-114.
30. Martins E.Q.V. An algorithm for ranking paths that may contain cycles. European Journal of Operational Research 1984, 18(1):123-130.
31. Miller-Hooks E.D., Mahmassani H.S. Least possible time paths in stochastic, time-varying networks. Computers and Operations Research 1998, 25(12):1107-1125.
32. Miller-Hooks E.D., Mahmassani H.S. Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transportation Research Record: Journal of the Transportation Research Board 1998, 1645:143-151.
33. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 2000, 34(2):198-215.
34. Nozick L.K., List G.F., Turnquist M.A. Integrated routing and scheduling in hazardous materials transportation. Transportation Science 1997, 31(3):200-215.
35. Pattanamekar P., Park D., Rilett L.R., Lee J., Lee C. Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty. Transportation Research Part C 2003, 11(5):331-354.
36. Ronen D. Dispatching petroleum products. Operations Research 1995, 43(3):379-387.
37. Saccomanno F., Chan A.Y. Economic evaluation of routing strategies for hazardous road shipments. Transportation Research Record 1985, 12-18.
38. Wijeratne A.B., Turnquist M.A., Mirchandani P.B. Multi-objective routing of hazardous materials in stochastic networks. European Journal of Operational Research 1993, 65:33-43.
39. Warburton A. Approximation of pareto optima in multiple objective, shortest-path problems. Operations Research 1987, 35(1):70-79.
40. Yen J.Y. Finding the K shortest loopless paths in a network. Management Science 1971, 17:712-716.
41. Ziliaskopoulos A., Mahmassani H. Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transportation Research Record 1993, 1403:94-100.