A Multi-Objective Emergency Rescue Facilities Location Model for Catastrophic Interlocking Chemical Accidents in Chemical Parks

Robust multi‐objective vehicle routing problem with time windows for hazardous materials transportation

“…It is worth mentioning that all three algorithms use the same uncertain set and robust criterion ( WRC ) to transform the MO‐RVRPTW to its robust counterpart . The goal of an algorithm for MOP is often to seek a set of solutions that perform well in terms of convergence and diversity [25, 33].…”

“…To further compare the performance of the three algorithms, the inverted generational distance (IGD) metric [36] is employed. IGD is a common metric in multi‐objective optimisation that can measure both the convergence and diversity of the algorithm [33]. Lower value of IGD can be defined as a better RPOF obtained approximating the true RPOF from the convergence and diversity viewpoints.…”

A Systematic Literature Review on Safety Research Related to Chemical Industrial Parks

“…Emergency management is essential to mitigate and prevent catastrophic consequences [54][55][56][57]. Furthermore, emergency management in a CIP ( Figure 4) plays an important role in guaranteeing its sustainability and safety [55,58,59]. Due to uncertainties related to the dangers of hazardous materials and human factors, emergency management within a CIP needs to pay more attention to systems management and operational research [55].…”

“…Therefore, some studies have contributed to addressing this problem by developing new algorithms. For instance, Men et al [58] proposed an optimization algorithm to allocate emergency resources for covering the requirement of all demand points. However, the location optimization in CIPs is rather complex due to all kinds of uncertainties related to human, material, and environmental factors involved in the requirement of emergency resources.…”

“…Some advanced methods (e.g., probabilistic approaches and stochastic programs) that, if applied In the case of the optimization of the allocation of emergency resource repositories or shelters on CIPs, it is not so easy to cover the emergency requirement of multi-plants since the multi-objective optimization is a typical NP-hard problem (a problem is NP-hard if every problem in non-deterministic polynomial is polynomial transformable to it. The optimization of the allocation of an emergency site in order to cover the requirement of multi-plants can be formulated by the multi-objective traveling salesman problem and multi-objective knapsack problem, which are well-known NP-hard problems) [58,[60][61][62]. Therefore, some studies have contributed to addressing this problem by developing new algorithms.…”