Routing and scheduling hazardous material shipments: Nash game approach

Transportmetrica B

Volumn 1, Issue 3, 2013, Pages 237-260

  Szeto, W Y ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Hazardous materials; Linear programming; Maxmin problems; Nash game; Routing and scheduling

Indexed keywords

EID: 84900391472     PISSN: 21680566     EISSN: 21680582     Source Type: Journal    
DOI: 10.1080/21680566.2013.861330     Document Type: Article

References (54)

1. Akgün, V., A. Parekh, R. Batta, and C. M. Rump. 2007. "Routing of a Hazmat Truck in the Presence of Weather Systems." Computers & Operations Research 34 (5): 1351-1373.
2. Bell, M. G. H. 2000. "A Game Theory Approach to Measuring the Performance Reliability of Transport Networks." Transportation Research Part B 34 (6): 533-545.
3. Bell, M. G. H. 2003. "The Use of Game Theory to Measure theVulnerability of Stochastic Networks." IEEE Transactions on Reliability 52 (1): 63-68.
4. Bell, M. G. H. 2004. "Games, Heuristics, and Risk Averseness in Vehicle Routing Problems." Journal of Urban Planning and Development 130 (1): 37-41.
5. Bell, M. G. H. 2006. "Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials." Networks and Spatial Economics 6 (3-4): 253-265.
6. Bell, M. G. H. 2007. "Mixed Routing Strategies for Hazardous Materials: Decision-Making under Complete Uncertainty." International Journal of Sustainable Transportation 1 (2): 133-142.
7. Bell, M. G. H., and C. Cassir. 2002. "Risk-Averse User Equilibrium Traffic Assignment: An Application of Game Theory." Transportation Research Part B 36 (8): 671-681.
8. Bell, M. G. H., U. Kanturska, J.-D. Schmocker, andA. Fonzone. 2008. "Attacker-Defender Models and Road Network Vulnerability." Philosophical Transactions of the Royal Society A 366 (1872): 1893-1906.doi:10.1098/rsta.2008.0019
9. Bewig, M. 2009. "Pipeline and Hazardous Materials Safety Administration: Who Is Cynthia Quarterman?"http://www.allgov.com/ Appointments-and-Resignations/ViewNews/Pipeline-and-Hazardous-Materi als-Safety-Administration-Who-Is-Cynthia-Quarterman-91223.
10. Brown, G., M. Carlyle, J. Salmeron, and R. K.Wood. 2006. "Defending Critical Infrastructure." Interfaces 36 (6): 530-544.
11. Carotenuto, P., S. Giordani, and S. Ricciardelli. 2007. "Finding Minimum and Equitable Risk Routes for Hazmat Shipments." Computers & Operations Research 34 (5): 1304-1327.
12. Cassir, C., M. G. H. Bell, and J.-D. Schmöcker. 2003. "A Normative Assessment of Transport Network Reliability Based on Game Theory." In Network Reliability of Transport, edited by M. G. H. Bell and Y. Iida, 225-243. Oxford: Pergamon.
13. Cox, R. G., and M.A. Turnquist. 1986. "Scheduling Truck Shipments of Hazardous Materials in the Presence of Curfews." Transportation Research Record 1063: 21-26.
14. Dadkar, Y., D. Jones, and L. K. Nozick. 2008. "Identifying Geographically Diverse Routes for the Transportation of Hazardous Materials." Transportation Research Part E 44 (3): 333-349.
15. Dadkar, Y., L. Nozick, and D. Jones. 2010a. "Routing of Hazardous Material Shipments under the Threat of Terrorist Attack." In Security and Environmental Sustainability of Multimodal Transport, edited by M.G.H. Bell, S.H. Hosseinloo and U. Kanturska, 89-110. London: Springer.
16. Dadkar, Y., L. Nozick, and D. Jones. 2010b. "Optimizing Facility Use Restrictions for the Movement of Hazardous Materials." Transportation Research Part B 44 (2): 267-281.
17. Dantzig, G. B. 1951. "A Proof of the Equivalence of the Programming Problem and the Game Problem." In Activity Analysis of Production and Allocation, edited by T. C. Koopmans, 330-335. New York: John Wiley & Sons.
18. Erkut, E., and A. Ingolfsson. 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning." Transportation Science 34 (2): 165-179.
19. Erkut, E., S. Tjandra, and V. Verter. 2007. "Hazardous Materials Transportation." InVol. 14 of Handbooks in Operations Research and Management Science Transportation, edited by C. Barnhart and G. Laporte, 39-621. North-Holland: Elsevier.
20. Erkut, E., andV.Verter. 1995. "Hazardous Materials Logistics." In Facility Location:ASurvey of Applications and Methods, edited by Z. Drezner, 467-506. NewYork: Springer.
21. Gopalan, R., K. S. Kolluri, R. Batta, and M. H. Karwan. 1990. "Modeling of Equity in the Transportation of Hazardous Materials." Operations Research 38 (6): 961-973.
22. Granata, D. 2013. "Network Interdiction via a Critical Disruption Path: Branch-and-Price Algorithms." Computers & Operations Research 40 (11): 2689-2702.
23. Hillier, F. S., and G. J. Lieberman. 1990. Introduction to Operations Research. NewYork: McGraw-Hill.
24. Iryo, T. 2013. "Properties of Dynamic User Equilibrium Solution: Existence, Uniqueness, Stability, and Robust Solution Methodology." Transportmetrica B: Transport Dynamics 1 (1): 52-67.
25. List, G., P. Mirchandani, M. Turnquist, and K. Zofrafos. 1991. "A Modelling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing-Scheduling and Facility Location." Transportation Science 25 (2): 100-114.
26. Lo, H. K., and W. Y. Szeto. 2002. "A Cell-Based Dynamic Traffic Assignment Model: Formulation and Properties." Mathematical and Computer Modelling 35 (7-8): 849-865.
27. Lo, H. K., andW.Y. Szeto. 2005. "Road Pricing Modeling for Hyper-Congestion." Transportation Research Part A 39 (7-9): 705-722.
28. Lo, H. K., and W. Y. Szeto. 2009. "Time-Dependent Transport Network Design Under Cost-Recovery." Transportation Research Part B 43 (1): 142-158.
29. Long, J. C., Z.Y. Gao, H. Z. Zhang, andW.Y. Szeto. 2010. "A Turning Restriction Design Problem in Urban Road Networks." European Journal of Operational Research 206 (3): 569-578.
30. Meng, Q., D. H. Lee, and R. L. Cheu. 2005. "Multiobjective Vehicle Routing and Scheduling Problem with Time Window Constraints in Hazardous Material Transportation." ASCE Journal of Transportation Engineering 131 (9): 699-707.
31. Nash, J. 1951. "Non-Cooperative Games." Annals of Mathematics 54 (2): 286-295.
32. von Neumann, J. 1928. "Zur Theorie der Gessellshaftspiele." Mathematische Annalen 100 (1): 295-320.
33. Nozick, K. L., G. F. List, and M.Turnquist. 1997. "Integrated Routing and Scheduling in Hazardous Materials Transportation." Transportation Science 31 (3): 200-215.
34. Reilly, A., L. Nozick, N. Xu, and D. Jones. 2012. "Game Theory-Based Identification of Facility Use Restrictions for theMovement of Hazardous Materials underTerrorist Threat."Transportation Research Part E 48 (1): 115-131.
35. Royset, J. O., and R. K. Wood. 2007. "Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem." INFORMS Journal on Computing 19 (2): 175-184.
36. Schmöcker, J.-D. 2010. "On Decision Principles for Routing Strategies Under Various Types of Risks" In Security and Environmental Sustainability of Multimodal Transport, edited by M. G. H. Bell et al., 57-71. London: Springer.
37. Shor, M. 2005. "Non-Cooperative Game." Game Theory.net. Accessed August 28, 2009. http://www.gametheory.net/dictionary/Non- CooperativeGame.html.
38. Sumalee, A., R. X. Zhong, T. L. Pan, andW.Y. Szeto. 2011. "Stochastic Cell Transmission Model (SCTM): A Stochastic Dynamic Traffic Model for Traffic State Surveillance and Assignment." Transportation Research Part B 45 (3): 507-533.
39. Szeto, W.Y. 2011. CooperativeGameApproaches to Measuring Network Reliability Considering Paradoxes." Transportation Research Part C 19 (2): 229-241.
40. Szeto, W.Y., X. Q. Jaber, and M. O'Mahony. 2010. "Time-Dependent Discrete Network Design Frameworks Considering Land Use." Computer-Aided Civil and Infrastructure Engineering 25 (6): 411-426.
41. Szeto, W. Y., Y. Jiang, and A. Sumalee. 2011. "A Cell-Based Model for Multi-Class Doubly Stochastic Dynamic Traffic Assignment." Computer-Aided Civil and Infrastructure Engineering 26 (8): 595-611.
42. Szeto, W. Y., Y. Jiang, D. Z. W. Wang, and A. Sumalee. 2013. "A Sustainable Road Network Design Problem with Land Use Transportation Interaction over Time." Networks and Spatial Economics: 1-32. doi:10.1007/s11067-013- 9191-9.
43. Szeto, W. Y., and H. K. Lo. 2005a. "Strategies For Road Network Design over Time: Robustness under Uncertainty." Transportmetrica 1 (1): 47-63.
44. Szeto, W.Y., and H. K. Lo. 2005b. "The Impact of Advanced Traveler Information Services on Travel Time and Dchedule Delay Costs." Journal of Intelligent Transportation Systems: Technology, Planning, and Operations 9 (1): 47-55.
45. Szeto, W.Y., and H. K. Lo. 2008. "Time-DependentTransport Network Improvement andTolling Strategies." Transportation Research Part A 42 (2): 376-391.
46. Szeto, W.Y., L. O'Brien, and M. O'Mahony. 2006. "Risk-Averse Traffic Assignment with Elastic Demands: NCP Formulation and Solution Method for Assessing Performance Reliability." Networks and Spatial Economics 6 (3-4): 313-332.
47. Szeto, W. Y., L. O'Brien, and M. O'Mahony. 2009. "Measuring Network Reliability by Considering Paradoxes:The Multiple NetworkDemonApproach. "Transportation Research Record 2090 (1): 42-50.
48. Verter, V., and B. Y. Kara. 2008. "A Path-Based Approach for Hazmat Transport Network Design." Management Science 54 (1): 29-40.
49. Washburn, A., and R. K.Wood. 1995. "Two-Person Zero-Sum Games for Network Interdiction." Operations Research 43 (2): 243-251.
50. Watling, D. P., and G. E. Cantarella. 2013. "Modelling Sources of Variation in Transportation Systems: Theoretical Foundations of Day-to-Day Dynamic Models." Transportmetrica B: Transport Dynamics 1 (1): 3-32.
51. Wood, R. K. 1993. "Deterministic Network Interdiction." Mathematical and Computer Modelling 17 (2): 1-18.
52. Yang, H., and Q. Meng 1998. "Departure Time, Route Choice and Congestion Toll in a Queuing Network with Elastic Demand." Transportation Research Part B 32 (4): 247-260.
53. Zhang, H. M., Y. Nie, and Z. Qian. 2013. "Modelling Network Flow with andWithout Link Interactions: The Cases of Point Queue, Spatial Queue and Cell Transmission Model." Transportmetrica B: Transport Dynamics 1 (1): 33-51.
54. Zografos, K. G., and K. N. Androutsopoulos. 2004. "A Heuristic Algorithm for Solving Hazardous Materials Distribution Problems." European Journal of Operational Research 152 (2): 507-519.