Computer and Modernization ›› 2024, Vol. 0 ›› Issue (09): 25-32.doi: 10.3969/j.issn.1006-2475.2024.09.005

Previous Articles     Next Articles

Dung Beetle Optimization Algorithm Integrating Multiple Strategies for Take-out Order Distribution Route Optimization

  

  1. (1. School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China;
    2. School of Information Science and Engineering, Jiaxing University, Jiaxing 314001, China;
    3. School of Artificial Intelligence, Sun Yat-sen University, Zhuhai 519082, China)
  • Online:2024-09-27 Published:2024-09-27

Abstract: With the development of takeaway industry, takeaway platforms have to select and plan efficient delivery routes among a large number of candidate orders. In order to satisfy the needs of both takeaway platforms and customers, an optimization model is established with the objectives of minimizing the delivery cost and maximizing the customer’s time satisfaction. The dung beetle optimization algorithm is used for solving the problem. Aiming at the problems that dung beetle optimization algorithm is prone to local optimization and low solving quality, a multi-strategy enhanced dung beetle optimization algorithm,  named IDBO (Improved Dung Beetle Optimizer)is proposed by introducing simulated polynomial mutation strategy, simulated annealing probability jump operator and simplex local search strategy. The solution results obtained on randomly generated test cases show that the IDBO algorithm achieves better optimal solution, mean, standard deviation, cost and satisfaction compared to other algorithms. The simulation results show that the three improvement strategies can improve the optimization ability of the algorithm and solve the model effectively.

Key words: take-out delivery, path planning, dung beetle optimization algorithm, simplex method, time window

CLC Number: