Please use this identifier to cite or link to this item:
Title: Link-based multi-class hazmat routing-scheduling problem : a multiple demon approach
Authors: Szeto, WY
Farahani, RZ
Sumalee, A 
Keywords: Transportation
Vehicle routing
Non-cooperative game
Hazardous materials
Issue Date: 2017
Publisher: Elsevier
Source: European journal of operational research, 2017, v. 261, no. 1, p. 337-354 How to cite?
Journal: European journal of operational research 
Abstract: This paper addresses a hazmat routing and scheduling problem for a general transportation network with multiple hazmat classes when incident probabilities are unknown or inaccurate. A multi-demon formulation is proposed for this purpose. This formulation is link-based (i.e., the decision variables are link flows) and can be transformed into other forms so that a wide range of solution methods can be used to obtain solutions. This paper also proposes a solution strategy to obtain route flow solutions without relying on exhaustive route enumeration and route generation heuristics. Examples are set up to illustrate the problem properties, the method of obtaining route flows from link flows, and the computational efficiency of the solution strategy. Moreover, a case study is used to illustrate our methodology for real-life hazmat shipment problems. From this case study, we obtain four key insights. First, to have the safest shipment of one type of hazmat, different trucks carrying the same type of hazmat need to take different routes and links. Second, in case of multiple-hazmat transportation, it is recommended to use different routes and links for the shipment of different hazmat types. This may increase travel time but can result in safer shipment. Third, if the degree of connectivity in a transportation network is high, the shipment company may have multiple solutions. Fourth, the hazmat flows on critical links (whose removal would make the network disconnected) must be distributed or scheduled over different periods to have safer shipment.
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2017.01.048
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 13, 2018


Last Week
Last month
Citations as of Dec 13, 2018

Page view(s)

Citations as of Dec 16, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.