Solving Hazmat Routing Problem in chaotic damage severity network under emergency environment

Mahmoudabadi, Abbas; Seyedhosseini, Seyed Mohammad

doi:10.1016/j.tranpol.2014.07.002

Cited by 12 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Enhancing and integrating technology (Huang et al, 2004;DeLorenzo et al, 2005), regulating rules (Gordon and Young, 2015) and optimizing routing-and scheduling decisions are various approaches that may improve transportation safety and security. Hazmat routing and routing-scheduling problems have a fairly rich literature (refer to Huang et al, 2004;Bell, 2006;Carotenuto et al, 2007a;Bersani et al, 2010;Kazantzi et al, 2011;Li and Leung, 2011;Xiang et al, 2012;Li et al, 2013;Kang et al, 2014;Mahmoudabadi and Seyedhosseini, 2014;Mishra et al, 2014;Rahman et al, 2014;Pamučar et al, 2016;Sahnoon et al, 2016;Sun et al, 2016;Bula et al, 2017;Özceylan et al, 2017;Wang et al, 2017;Yuan et al, 2017;Sun et al, 2018). Since the focus of this research is on hazmat routing-scheduling, in the upcoming subsections we only focus on hazmat routing-scheduling research studies and exclude pure hazmat routing research studies.…”

Section: Literature Reviewmentioning

confidence: 99%

Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game

Mohri

Asgari

Farahani

et al. 2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

We investigate a hazmat routing-scheduling problem. To minimize the overall expected risk, various vehicles may take different routes/schedules to avoid multiple accidents on the same link. Therefore, the company envisages two issues: (1) unfairly, a vehicle departing earlier from its origin may arrive earlier at its destination than the others leaving later; (2) focusing only on the minimization of risk may increase travel time/cost incurred by the company.We suggest a bi-objective game-theoretic formulation and solve it by a modified Adaptive Large Neighborhood Search and Simulated Annealing. We test the solution on a real-life case and extract practical insights.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game

Mohri

Asgari

Farahani

et al. 2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

show abstract

“…This constraint is formulated by equation (6) where E x (j) is the set of exiting arcs from and E n (j) is the set of entering arcs to node "j". More details in general modeling are available at [26] and in practical usage at [28].…”

Section:  Modeling Proceduresmentioning

confidence: 99%

“…Therefore, each dummy node represents the sum of transport supply or demand, defined by the number of trucks, for all O-Ds entered to or departed from the area under the study. More explanations on how to define boarder nodes are available at [28] since the same pattern is also used in this research work.…”

Section: Experimental Analysis 41 Case Studymentioning

confidence: 99%

Developing an Iterative Procedure to Estimate Origin-Destination Matrix Based on Two-Point License Plate Tracking Systems

et al. 2019

View full text Add to dashboard Cite

Origin-Destination Matrix, one of the most important elements in transportation planning, is usually estimated by various techniques such as mathematical modeling, statistical methods, and heuristic approaches. Since using electronic devices is rapidly increased to help decision makers to improve models' capabilities, an iterative procedure is proposed in this paper to estimate the O-D Matrix according to vehicles' license plates detection. The main concept is to track vehicles on the first and the last links equipped by plate camera over the shortest path from origins to destinations. A two-step procedure and mathematical models are developed to adjust assigned the passing traffic to the network links by minimizing deviations between the observed and estimated truck traffic volumes. The proposed procedure is explained by an illustrative example followed by validation using experimental road network that covers seven eastern provinces of Iran including 310 nodes, 400 two-way edges, and around 3600 origin and destination pairs. Results revealed that the proposed procedure is capable to estimate O-D matrix when the network links are optimally located and equipped by road camera detection systems. In addition, such as the other heuristic approaches, the proposed procedure is sensitive to the number of iterations on the estimation accuracy.

show abstract

“…In the aspect of route selection, a novel bio-inspire method was proposed to choose the optimal path from the optional choice by Zhang et al (2013b), in which both travel time and the path length were taken into consideration. In the paper of Mahmoudabadi and Seyedhosseini (2014), an iterative procedure using the concept of chaos of theory based on dynamic risk definition and dynamic damage severity network was proposed to determine the best route for transporting vital substances of fuel. Besides, the location problem is also an important research issue in the emergency logistics and services.…”

Section: Post-disaster Emergency Logistics and Servicesmentioning

confidence: 99%

Location and pricing of competitive service providers for post-disaster relief

Fan

Zhou

2017

IJISE

View full text Add to dashboard Cite

Abstract:In post-disaster relief, competitive emergency service providers place their stations quickly for timely rescue activities. To shorten the rescue time of the emergency services and ensure the profit of emergency service providers, an extended game model is formulated to solve the problem based on the classical Hotelling model. In the new model, logistics cost is paid by service providers who can obtain honour profit through providing service for the victims. The victims endure waiting times that consist of periods of response time and travelling time. The waiting times affect the victims' decisions and affect the equilibrium prices and profits. Numerical analysis implies that service providers obtain the highest profits on their equilibrium price when their locations are decided. Furthermore, locating both players near the ends of the disaster-affected line city is beneficial to increase the gross profits.

show abstract

Solving Hazmat Routing Problem in chaotic damage severity network under emergency environment

Cited by 12 publications

References 31 publications

Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game

Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game

Developing an Iterative Procedure to Estimate Origin-Destination Matrix Based on Two-Point License Plate Tracking Systems

Location and pricing of competitive service providers for post-disaster relief

Contact Info

Product

Resources

About