The maximin HAZMAT routing problem

Bronfman, Andrés; Marianov, Vladimir; Paredes-Belmar, Germán; Lüer-Villagra, Armin

doi:10.1016/j.ejor.2014.08.005

Cited by 54 publications

(25 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Accident risk is also considered along the temporal dimension by Meng et al (2005) and Toumazis and Kwon (2013), who consider time-dependent risk models, and by Zografos (2004), who examines the trade-off between travel time and risk. Note that some hazmat VRP models can be generalized to different types of undesirable externalities, such as noise, disturbance, and pedestrian safety (Bronfman et al 2015, Grabenschweiger et al 2018). Finally, consumer-oriented routing applications optimize safety from the opposite perspective, aiming to generate routes that are safe for the user (Kim et al 2014, Shah et al 2011).…”

Section: Externalitiesmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

234

View full text Add to dashboard Cite

Section: Externalitiesmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

234

View full text Add to dashboard Cite

“…Moreover, the complexity of calculation leads to the limited application in practical operation, although the linear model with integer variables could be theoretically solved by commercial software such as CPLEX [1]. Hence, there is a need to explore more effective solving approaches, and feasible heuristic algorithms are also able to be considered in depth [10]. In addition, this study has developed a heuristic calculation under principles of minimizing the maximum local risk for all HAZMAT shipments in the urban area.…”

Section: Algorithm Designmentioning

confidence: 99%

“…Fan et al made an urban HAZMAT transportation model with road closure consideration to deal with traffic restrictions [9]. Bronfman et al developed the max-min HAZMAT routing problem to ensure security along transport routes [10].…”

Section: Introductionmentioning

confidence: 99%

“…However, there has not been a study that specializes in the problem of total risk under the condition of maximum local risk in urban areas. Furthermore, the most closely related work with routing for HAZMAT transportation in cities was performed by Bronfman et al, who focused on a single transportation route for HAZMAT and the maximum distance for security [10]. In light of the demonstrated advantage of the minimum local consequence model over previous catastrophic avoidance techniques, here we make the first attempt to develop a method for minimizing the maximum local risk framework for urban road HAZMAT shipments.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Routing for Hazardous Materials Transportation in Urban Areas

Zhang

Feng

Yan³

et al. 2019

Symmetry

View full text Add to dashboard Cite

Hazardous materials (HAZMAT) are important for daily production in cities, which usually have a high population. To avoid the threat to public safety and security, the routes for HAZMAT transportation should be planned legitimately by mitigating the maximum risk to population centers. For the objective of min-max local risk in urban areas, this study has newly proposed an optimization model where the service of a link for HAZMAT transportation was taken as the key decision variable. Correspondingly, the symmetric problem of min-max optimization takes significant meanings. Moreover, in consideration of the work load of solving the model under a lot of decision variables, a heuristic algorithm was developed to obtain an optimal solution. Thereafter, a case study was made to test the proposed model and algorithm, and the results were compared with those generated by deterministic solving approaches. In addition, this research is able to be an effective reference for authorities on the management of HAZMAT transportation in urban areas.

show abstract

“…Bronfman A et al [37] introduced the maxi-sum hazmat routing problem, which maximizes the sum of the population-weighted distances from vulnerable centers to their closest point on the routes using multiple origin-to-destination (OD) pairs. Bronfman A et al [38] proposed an approach that maximized the weighted distance between the route and its closest vulnerable centre in order to minimize the potential consequences at the most exposed center. Nembhard D A et al [39] determined a hazmat path that maximizes a multi-attribute, non-order-preserving value function based on transportation cost and risk to the population.…”

mentioning

confidence: 99%

A Bi-Level Programming Model of Liquefied Petroleum Gas Transportation Operation for Urban Road Network by Period-Security

Jia

Zhang

et al. 2018

Sustainability

View full text Add to dashboard Cite

As a clean energy, Liquefied Petroleum Gas (LPG) is consistent with the coordinated and sustainable development of both the economy and environment. However, LPG is a hazardous material (hazmat) and is thus always transported in cylinders by vehicles on urban road networks to meet varying demand. This transport can threaten the surrounding citizens, vehicles, and even the whole urban area. Hence, LPG transportation should be focused on maintaining its security while simultaneously minimizing shipping costs. When LPG is moved through an urban area, its threat level fluctuates with the network congestion level, which continually varies by different time periods. So, variation in the magnitude of the threat posed by LPG transportation causes additional changes in the safe-related cost as well as the shipping cost. This study aims to solve the problem of an LPG transportation operation on an urban road network according to congested periods; the solution is based on cutting its two types of cost. In general, we should choose an LPG transport period that results in a lower safety cost, however optimization of an LPG transportation operation must minimize both the safety cost and shipping cost. This paper presents the problem of LPG flow distribution and vehicle dispatch scheme by "period-security" to rationalize the LPG transport risk level. Firstly, the impedance function of LPG flow distribution was constructed with a focus on the safety cost in different periods. Meanwhile, a bi-level programming model was built, in which the upper mixed binary integer programming model aims to minimize the shipping cost and the lower model is a user-equilibrium model that is aimed at calculating the distribution of the LPG demands on the given lines and in feasible periods. Then, we designed a heuristic algorithm based on the Genetic Algorithm to solve the upper model and embedded the Frank-Wolfe Algorithm to get the optimal LPG flow distribution solution. Numerical examples are presented which validate that the LPG optimal operation can realize a minimal safety cost and the minimum shipping cost for three LPG demand values by considering the congestion situation.

show abstract

The maximin HAZMAT routing problem

Cited by 54 publications

References 54 publications

A concise guide to existing and emerging vehicle routing problem variants

A concise guide to existing and emerging vehicle routing problem variants

Routing for Hazardous Materials Transportation in Urban Areas

A Bi-Level Programming Model of Liquefied Petroleum Gas Transportation Operation for Urban Road Network by Period-Security

Contact Info

Product

Resources

About