Journal of System Simulation ›› 2024, Vol. 36 ›› Issue (12): 2782-2796.doi: 10.16182/j.issn1004731x.joss.24-FZ0740E

• Papers • Previous Articles    

A Clustering-based Location Allocation Method for Delivery Sites under Epidemic Situations

Zhou Yaqiong, Chen Junqi, Li Weishi, Qiu Sihang, Ju Rusheng   

  1. College of System Engineering, National University of Defense Technology, Changsha 410073, China
  • Received:2024-07-10 Revised:2024-09-18 Online:2024-12-20 Published:2024-12-20
  • Contact: Ju Rusheng
  • About author:Zhou Yaqiong(2000-), female, master student, research area: crowd computing.
  • Supported by:
    National Natural Science Foundation of China(62202477)

Abstract:

To address the poor performance of commonly used intelligent optimization algorithms in solving location problems—specifically regarding effectiveness, efficiency, and stability—this study proposes a novel location allocation method for the delivery sites to deliver daily necessities during epidemic quarantines. After establishing the optimization objectives and constraints, we developed a relevant mathematical model based on the collected data and utilized traditional intelligent optimization algorithms to obtain Pareto optimal solutions. Building on the characteristics of these Pareto front solutions, we introduced an improved clustering algorithm and conducted simulation experiments using data from Changchun City. The results demonstrate that the proposed algorithm outperforms traditional intelligent optimization algorithms in terms of effectiveness, efficiency, and stability, achieving reductions of approximately 12% and 8% in time and labor costs, respectively, compared to the baseline algorithm.

Key words: location problem, clustering algorithm, intelligent optimization algorithm, Pareto front

CLC Number: