2019
DOI: 10.1016/j.jclepro.2018.09.228
|View full text |Cite
|
Sign up to set email alerts
|

Bi-objective vehicle routing problem for hazardous materials transportation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
28
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(28 citation statements)
references
References 21 publications
0
28
0
Order By: Relevance
“…In addition, the routing and scheduling of Hazmat transportation has also been widely investigated. Different routing optimization models, such as a game-theoretical model [19,20] and a multi-objective model [21][22][23][24], have been designed by considering the impact of different risk factors. Although useful and revealing, these studies paid more attention on the probability or injury severity of Hazmat accidents and provide limited information on the number of people evacuated due to the impact of Hazmat, which is another important and unique measure of Hazmat accident consequences [11].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, the routing and scheduling of Hazmat transportation has also been widely investigated. Different routing optimization models, such as a game-theoretical model [19,20] and a multi-objective model [21][22][23][24], have been designed by considering the impact of different risk factors. Although useful and revealing, these studies paid more attention on the probability or injury severity of Hazmat accidents and provide limited information on the number of people evacuated due to the impact of Hazmat, which is another important and unique measure of Hazmat accident consequences [11].…”
Section: Introductionmentioning
confidence: 99%
“…Various studies have been recommended Exact approaches to solve the VRPT problem, [11,12,[18][19][20]. Also, As VRPT is a Np-Hard problem with the complicated calculation, many studies have focused on the heuristic algorithms [9,[21][22][23].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In most cases, heuristic algorithms are only able to solve the small-sized problems whereas most practical applications usually involve a large number of customers. Hence, some researchers tried to use the meta-heuristic algorithms in their studies [20,[25][26][27][28][29]. As one, the presented three-objective mathematical model by Jalili Ball et al [30] minimizes the total costs (cost of transportation and cost of delay) and total risks due to the time window limitation and the environmental factors to restore the balance of the allocated route to each vehicle.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A variant of the variable neighbourhood search (VNS) algorithm is employed to solve the problem which integrates a variable neighbourhood descent algorithm for local search, and a perturbation mechanism (shaking neighbourhoods). Recently, they proposed a bi‐objective model based on the original research, which simultaneously minimises two conflicting objectives, the total routing risk and the total transportation cost [8]. To find non‐dominated solutions, a multi‐objective neighbourhood dominance‐based algorithm and an ɛ‐constraint meta‐heuristic algorithm were proposed.…”
Section: Introductionmentioning
confidence: 99%
“…It is unrealistic to consider only risk minimisation. Although safety is important, economic effect is also an optimisation object that cannot be ignored [8]. On the other hand, when assessing the transportation risk, relevant parameters tend to be uncertain.…”
Section: Introductionmentioning
confidence: 99%