A Maritime Global Route Planning Model for Hazardous Materials Transportation
- 1 February 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 33 (1), 34-48
- https://doi.org/10.1287/trsc.33.1.34
Abstract
We consider the strategic level routing problem of hazardous materials in marine waters over a multicommodity network with multiple origins–destinations. The problem is motivated by the fact that selecting optimal routes by each origin–destination pair or by each type of material is myopic and may result in overloading certain links of the transportation network and, consequently, in poor overall system performance. We employ a network flow model, instead of the traditional shortest path formulation, to capture the multicommodity, multiple origin–destination nature of the problem. An efficient two-phase solution approach is proposed. The proposed solution methodology is illustrated through a single hazmat problem followed by a large scale case study of the marine transportation system of oil products in the Gulf of Mexico.Keywords
This publication has 17 references indexed in Scilit:
- Maritime Route Risk Analysis for Hazardous Materials TransportationIFAC Proceedings Volumes, 1997
- Development of a National Marine Oil Transportation System ModelSpill Science & Technology Bulletin, 1997
- Strategic Planning Model for Marine Oil Transportation in the Gulf of MexicoTransportation Research Record: Journal of the Transportation Research Board, 1996
- Optimal location of routes for vehicles transporting hazardous materialsEuropean Journal of Operational Research, 1995
- Hazardous Materials LogisticsPublished by Springer Nature ,1995
- Optimal Obnoxious Paths on a Network: Transportation of Hazardous MaterialsOperations Research, 1988
- Developing a risk/cost framework for routing truck movements of hazardous materialsAccident Analysis & Prevention, 1988
- Rerouting railroad shipments of hazardous materials to avoid populated areasAccident Analysis & Prevention, 1983
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A dual algorithm for the constrained shortest path problemNetworks, 1980