EUVIMEDEUVIMED entdecken
Crossref

A Parallel Genetic Algorithm With Variable Neighborhood Search for the Vehicle Routing Problem in Forest Fire-Fighting

Xiang Li, Nan Chen, Hongguang Ma, Fapeng Nie, Xianzhe Wang

IEEE Transactions on Intelligent Transportation Systems · 2024-10 · 25 (10) · 14359-14375

DOI: 10.1109/tits.2024.3395930 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Intelligent Transportation Systems, 2024-10. Verfasst von Xiang Li und 4 weiteren Autor:innen. Die Arbeit wurde bisher 36-mal zitiert (Crossref) und nennt 48 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Beijing Nova Program, Beijing Social Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

With the challenge of making online decisions in the face of escalating losses, the vehicle routing problem in forest fire-fighting places great emphasis on the computing efficiency of algorithms. This paper investigates the route optimization for fire-fighting vehicles and formulates a mixed integer linear programming model to minimize the total losses of overall fire spots. A parallel genetic algorithm with variable neighborhood search (PGA-VNS) is developed, which includes a parallelized evolution process of multiple sub-populations for ensuring the fast convergency to a high-quality solution, and a multi-operator variable searching process to promote the convergency to a nearly optimal solution. By comparing the computational results for various-scale instances, the PGA-VNS is demonstrated to be more effective than the baseline algorithms (i.e., Gurobi, GA, PSO, ALNS, VNS, GA-ALNS, and GA-VNS). Furthermore, the proposed model is extended to the scenario of unmanned aerial vehicles (UAVs), taking into account limited flight range and load impact constraints. The results could support the scheduling and routing for fire engines or UAVs in minimizing the losses caused by forest fires.

Förderung

  • National Natural Science Foundation of China
  • Beijing Nova Program
  • Beijing Social Science Foundation
  • Innovation Centre for Digital Business and Capital Development of Beijing Technology and Business University
  • Funds for First-Class Discipline Construction

Zitieren

APA

Li, X., Chen, N., Ma, H., Nie, F., & Wang, X. (2024). A Parallel Genetic Algorithm With Variable Neighborhood Search for the Vehicle Routing Problem in Forest Fire-Fighting. IEEE Transactions on Intelligent Transportation Systems, 25(10), 14359-14375. https://doi.org/10.1109/tits.2024.3395930

Vancouver

Li X, Chen N, Ma H, Nie F, Wang X. A Parallel Genetic Algorithm With Variable Neighborhood Search for the Vehicle Routing Problem in Forest Fire-Fighting. IEEE Transactions on Intelligent Transportation Systems. 2024;25(10):14359-14375. doi:10.1109/tits.2024.3395930

BibTeX
@article{Li2024,
  author = {Li, Xiang and Chen, Nan and Ma, Hongguang and Nie, Fapeng and Wang, Xianzhe},
  title = {A Parallel Genetic Algorithm With Variable Neighborhood Search for the Vehicle Routing Problem in Forest Fire-Fighting},
  journal = {IEEE Transactions on Intelligent Transportation Systems},
  year = {2024},
  volume = {25},
  number = {10},
  pages = {14359--14375},
  doi = {10.1109/tits.2024.3395930}
}
Kostenlos starten →