[1]LI Meng,HE Weihui,MAO Pandeng,et al.A genetic-firework hybrid algorithm oriented to maintenance resource distribution scheduling[J].CAAI Transactions on Intelligent Systems,2022,17(1):88-97.[doi:10.11992/tis.202108027]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
17
Number of periods:
2022 1
Page number:
88-97
Column:
学术论文—智能系统
Public date:
2022-01-05
- Title:
-
A genetic-firework hybrid algorithm oriented to maintenance resource distribution scheduling
- Author(s):
-
LI Meng1; HE Weihui2; MAO Pandeng1; QI Xiaogang3; LIU Lifang1
-
1. School of Computer Science and Technology, Xidian University, Xi’an 710071, China;
2. Xi’an Satellite Control Center, Xi’an 710049, China;
3. School of Mathematics and Statistics, Xidian University, Xi’an 710071, China
-
- Keywords:
-
maintenance resources; distribution scheduling; genetic algorithm; fireworks algorithm; VRP; multi-distribution center; resource scheduling; time window
- CLC:
-
TP391
- DOI:
-
10.11992/tis.202108027
- Abstract:
-
In order to alleviate the impact of belated supply of maintenance resources on smooth maintenance activities, in this paper, a semi-open collaborative resource distribution scheduling model is established based on the multiple distribution centers’ vehicle routing problem (VRP) with time-windows to achieve collaboration and mutual guarantee among multiple depots. In this way, the delivery time and the scheduling cost are reduced and the overall resource supply efficiency is improved. In order to efficiently solve the model, this paper proposes a genetic-firework hybrid algorithm, which introduces the explosion operator of the firework algorithm into the classical genetic algorithm to increase the amount of good individuals and the diversity of the population, so as to improve its optimization capacity. And through comparison of simulative experiments, it is proved that the hybrid algorithm has higher solving efficiency and that the introduction of explosion operators can solve the problem that genetic algorithm is easy to converge.