Dangerous Goods Vehicle Routing Optimization Model Considering Time-Varying Conditions

To achieve safety control and minimize transportation costs in the transportation of dangerous goods vehicles, a multi-objective path optimization model is established. The transportation risk is evaluated by the population exposure number of passing road sections. A time-dependent function based on travel speed is employed to capture the dynamic characteristics of the urban road network. An optimization model with the goals of minimizing total transportation cost and transportation risk is constructed. A multi-objective evolutionary algorithm is designed based on NSGA-II combined with the simulated annealing algorithm. The model and algorithm are verified by simulating the dangerous material transportation network with 19 demand nodes. The results show that the algorithm can be used to obtain Pareto solutions, which will provide decision support for the scheduling of dangerous material transportation vehicles.

Authors

Institutions

Publication Details

Published
2024-10-11
DOI
https://doi.org/10.1109/cbase64041.2024.10824349
Citations
2
Primary Topic
Evaluation and Optimization Models
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dangerous Goods Vehicle Routing Optimization Model Considering Time-Varying Conditions

Senlai Zhu, Jinyu Han
2 citations
Evaluation and Optimization Models
0.73
article

Dangerous Goods Vehicle Routing Optimization Model Considering Time-Varying Conditions

Senlai Zhu, Jinyu Han
article en
2 citations

Abstract

To achieve safety control and minimize transportation costs in the transportation of dangerous goods vehicles, a multi-objective path optimization model is established. The transportation risk is evaluated by the population exposure number of passing road sections. A time-dependent function based on travel speed is employed to capture the dynamic characteristics of the urban road network. An optimization model with the goals of minimizing total transportation cost and transportation risk is constructed. A multi-objective evolutionary algorithm is designed based on NSGA-II combined with the simulated annealing algorithm. The model and algorithm are verified by simulating the dangerous material transportation network with 19 demand nodes. The results show that the algorithm can be used to obtain Pareto solutions, which will provide decision support for the scheduling of dangerous material transportation vehicles.

Nantong University (CN)
Openalex Percentile: Top 27%
Evaluation and Optimization Models
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.