Citation: | Hongliang TANG, Bolin WU, Wang HU, Chengxu KANG. Earthquake Emergency Resource Multiobjective Schedule Algorithm Based on Particle Swarm Optimization[J]. Journal of Electronics & Information Technology, 2020, 42(3): 737-745. doi: 10.11999/JEIT190277 |
It is of great significance to optimize emergency resource schedule for earthquake emergency rescue. The conflicting multiple schedule goals, such as time, fairness, and cost, should be taken into consideration together in an earthquake emergency resource schedule. A three-objective optimization model with constraints is constructed according to earthquake emergency resource schedule problems. An Adaptive MultiObjective Particle Swarm Optimization (PSO) based on Evolutionary State Evaluation (AMOPSO/ESE) is proposed to optimize this model for obtaining the Pareto optimal set. At the same time, based on the decision behavior pattern of "macro first and micro later", the two-level optimal solution sets consisting of an interest optimal solution set and their neighborhood optimal solution sets are proposed to represent the Pareto front roughly, which can simplify the decision-making process. The simulation results show that the multiobjective resource schedules can be effectively obtained by the AMOPSO/ESE algorithm, and the performance of the proposed algorithm is better than that of the chosen competed algorithms in terms of convergence and diversity.
唐伟勤, 邹丽, 郭其云. 多应急点多需求点物资调度的灰色多目标规划[J]. 中国安全生产科学技术, 2016, 12(11): 148–152. doi: 10.11731/j.issn.1673-193x.2016.11.025
TANG Weiqin, ZOU Li, and GUO Qiyun. Grey multi-objective programming for materials dispatching from multiple supply points to multiple demand points[J]. Journal of Safety Science and Technology, 2016, 12(11): 148–152. doi: 10.11731/j.issn.1673-193x.2016.11.025
|
范杰. 震后初期救灾物资两阶段调度优化研究[D]. [硕士论文], 北京交通大学, 2017.
FAN Jie. Research on two-stage dispatching optimization of relief supplies early after the earthquake[D]. [Master dissertation], Beijing Jiaotong University, 2017.
|
KENNEDY J and EBERHART R. Particle swarm optimization[C]. ICNN'95-International Conference on Neural Networks, Perth, Australia, 1995: 1942–1948. doi: 10.1109/ICNN.1995.488968.
|
BONYADI M R and MICHALEWICZ Z. Particle swarm optimization for single objective continuous space problems: A review[J]. Evolutionary Computation, 2017, 25(1): 1–54. doi: 10.1162/EVCO_r_00180
|
COELLO C A C, PULIDO G T, and LECHUGA M S. Handling multiple objectives with particle swarm optimization[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 256–279. doi: 10.1109/TEVC.2004.826067
|
AL MOUBAYED N, PETROVSKI A, and MCCALL J. D 2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces[J]. Evolutionary Computation, 2014, 22(1): 47–77. doi: 10.1162/EVCO_a_00104
|
WU Bolin, HU Wang, HE Zhenan, et al. A many-objective particle swarm optimization based on virtual Pareto front[C]. IEEE Congress on Evolutionary Computation, Rio de Janeiro, Brazil, 2018: 1–8. doi: 10.1109/CEC.2018.8477802.
|
LI Li, WANG Wanliang, and XU Xinli. Multi-objective particle swarm optimization based on global margin ranking[J]. Information Sciences, 2017, 375: 30–47. doi: 10.1016/j.ins.2016.08.043
|
HU Wang and YEN G G. Adaptive multiobjective particle swarm optimization based on parallel cell coordinate system[J]. IEEE Transactions on Evolutionary Computation, 2015, 19(1): 1–18. doi: 10.1109/tevc.2013.2296151
|
毕晓君, 张磊, 肖婧. 基于双种群的约束多目标优化算法[J]. 计算机研究与发展, 2015, 52(12): 2813–2823. doi: 10.7544/issn1000-1239.2015.20148025
BI Xiaojun, ZHANG Lei, and XIAO Jing. Constrained multi-objective optimization algorithm based on dual populations[J]. Journal of Computer Research and Development, 2015, 52(12): 2813–2823. doi: 10.7544/issn1000-1239.2015.20148025
|
DEB K and JAIN H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints[J]. IEEE Transactions on Evolutionary Computation, 2014, 18(4): 577–601. doi: 10.1109/TEVC.2013.2281535
|