Paper
7 December 2023 Emergency facilities location problem under the risk of damage
Jing Liang, Wenshuang Yu, Yujie Yun
Author Affiliations +
Proceedings Volume 12941, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2023); 129414F (2023) https://doi.org/10.1117/12.3011538
Event: Third International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 203), 2023, Yinchuan, China
Abstract
Major emergencies may cause some distribution centers to be damaged. In order to deliver emergency supplies to customers quickly and efficiently, the problem of constructing new emergency facilities to meet customer demand when existing facilities are damaged is proposed. And a facility capacity siting model with the objective of minimizing total cost while satisfying customer demand constraints is constructed. The problem belongs to the NP-Hard problem, so this paper adopts an improved genetic algorithm, combining the traditional genetic algorithm with the particle swarm algorithm, giving the advantages of the particle swarm algorithm in the local search, and introducing the best fitness solution sequence into the local search of the particle swarm algorithm. The results of the study case show that the solution speed and solution quality are improved compared with the traditional genetic algorithm.
(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Jing Liang, Wenshuang Yu, and Yujie Yun "Emergency facilities location problem under the risk of damage", Proc. SPIE 12941, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2023), 129414F (7 December 2023); https://doi.org/10.1117/12.3011538
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Particles

Defense and security

Particle swarm optimization

Reliability

Natural disasters

Social sciences

Back to Top