LCEVES: A locally constrained evolutionary algorithm for vehicle evacuation scheduling under urban waterlogging risk
- 7 June 2024
- journal article
- research article
- Published by Wiley in Transactions in GIS
- Vol. 28 (5) , 1439-1461
Abstract
The global rising level of climate change has caused significant disruptions in city traffic patterns due to intense heavy rains causing urban waterlogging disasters worldwide. These disasters have also resulted in massive economic losses and casualties. In consideration of these issues, the current challenge for urban disaster emergency response is to determine strategies to arrange for emergency vehicle scheduling as soon as urban waterlogging expands in a way that minimizes casualties and financial losses. This article proposes the Locally Constraint Evolutionary algorithm for Vehicle Evacuation Scheduling (LCEVES), which includes the following features to address the vehicle emergency evacuation problems in urban waterlogging zones specifically for regulated vehicles (e.g., buses, vehicles transporting hazardous materials, etc.). Firstly, a general technical route for vehicle emergency evacuation under urban waterlogging risk, secondly an optional routes search mechanism for vehicle evacuation in the waterlogging area and thirdly a locally constraint evolutionary algorithm for vehicle evacuation in the waterlogging area. The experiments show that LCEVES improves vehicle evacuation efficiency and reduces the risk of affected vehicles, providing an effective means for vehicle evacuation in the waterlogging zone. This research provides an effective method for solving vehicle evacuation scheduling challenges during urban waterlogging and also has significance for vehicle scheduling in other types of disasters.Keywords
Funding Information
- National Natural Science Foundation of China (42271425, 41871312)
- National Key Research and Development Program of China (2022YFB3903405)
This publication has 41 references indexed in Scilit:
- An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windowsComputers & Industrial Engineering, 2021
- A branch-and-bound approach for a Vehicle Routing Problem with Customer CostsEURO Journal on Computational Optimization, 2021
- TRANSMax II: Designing a flexible model for transit route optimizationComputers, Environment and Urban Systems, 2020
- A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operationsComputers & Operations Research, 2019
- Efficiently solving very large-scale routing problemsComputers & Operations Research, 2019
- A column generation algorithm for vehicle scheduling and routing problemsComputers & Industrial Engineering, 2019
- Mining massive taxi trajectories for rapid fastest path planning in dynamic multi-level landmark networkComputers, Environment and Urban Systems, 2018
- A Simulation Based Restricted Dynamic Programming approach for the Green Time Dependent Vehicle Routing ProblemComputers & Operations Research, 2017
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service timeApplied Mathematical Modelling, 2016
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windowsEuropean Journal of Operational Research, 2016