Knowledge-driven ant colony optimization algorithm for vehicle routing problem in instant delivery peak period

被引:9
作者
Hou, Ying [1 ,2 ]
Guo, Xinyu [1 ,2 ]
Han, Honggui [1 ,2 ]
Wang, Jingjing [1 ,2 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Engn Res Ctr Digital Community, Beijing Lab Urban Mass Transit,Minist Educ, Beijing, Peoples R China
[2] Beijing Key Lab Computat Intelligence & Intelligen, Beijing, Peoples R China
基金
美国国家科学基金会; 北京市自然科学基金;
关键词
Ant colony optimization algorithm; Vehicle routing problem; Instant delivery; Peak period; EVOLUTIONARY; SEARCH;
D O I
10.1016/j.asoc.2023.110551
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Instant delivery is an important part of urban logistics distribution, which realizes point-to-point distribution between merchants and customers. During the peak period of orders, instant delivery is a large-scale variable NP-hard combinatorial optimization problem, which increases the difficulty and complexity of scheduling greatly. To solve the large-scale vehicle routing problem of instant delivery in peak periods, a knowledge-driven ant colony optimization (KDACO) algorithm is proposed in this paper. First, the knowledge base is established to guide evolutionary search, including the knowledge of order priority and the feature knowledge of feasible schemes. Second, the pheromone supplementation strategy is designed based on the knowledge of order priority, enhancing the guiding ability of the pheromone table. Third, the adaptive evolutionary operator is designed based on the feature knowledge of feasible schemes, improving the optimization efficiency of the algorithm. Finally, numerical experiments on extensive classical datasets show that the proposed KDACO can obtain superior performance to other state-of-the-art algorithms in the instant delivery peak period. & COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] An efficient improvement of ant colony system algorithm for handling capacity vehicle routing problem
    Mutar, Modhi Lafta
    Burhanuddin, M. A.
    Hameed, Asaad Shakir
    Yusof, Norzihani
    Mutashar, Hussein Jameel
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2020, 11 (04) : 549 - 564
  • [42] Researvh on Vehicle Routing Problem with Time Windows Based on Improving Ant Colony Algorithm
    Li Guiyun
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 415 - 418
  • [43] Fastest Complete Vehicle Routing Problem Using Learning Multiple Ant Colony Algorithm
    Wen, Siyuan
    Wei, Hongcui
    ICMS2010: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON MODELLING AND SIMULATION, VOL 2: MODELLING AND SIMULATION IN ENGINEERING, 2010, : 113 - 116
  • [44] Fastest Complete Vehicle Routing Problem Using Learning Multiple Ant Colony Algorithm
    Wen SiYuan
    Li Ying
    HIGH PERFORMANCE STRUCTURES AND MATERIALS ENGINEERING, PTS 1 AND 2, 2011, 217-218 : 1044 - +
  • [45] An ant colony optimization based on local search for the vehicle routing problem with simultaneous pickup-delivery and time window
    Wu, Hongguang
    Gao, Yuelin
    APPLIED SOFT COMPUTING, 2023, 139
  • [46] Dual-information guided ant colony optimization algorithm for green multi-compartment vehicle routing problem
    Guo N.
    Shen Q.-Y.
    Qian B.
    Na J.
    Hu R.
    Mao J.-L.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2024, 41 (06): : 1067 - 1078
  • [47] Multi-strategy ant colony optimization with k-means clustering algorithm for capacitated vehicle routing problem
    Zhaojun Zhang
    Simeng Tan
    Jiale Qin
    Kuansheng Zou
    Shengwu Zhou
    Cluster Computing, 2025, 28 (3)
  • [48] Application of Ant Colony Algorithms to Solve the Vehicle Routing Problem
    Song, Mei-xian
    Li, Jun-qing
    Li, Li
    Yong, Wang
    Duan, Pei-yong
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 831 - 840
  • [49] A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows
    Hongguang Wu
    Yuelin Gao
    Wanting Wang
    Ziyu Zhang
    Complex & Intelligent Systems, 2023, 9 : 2491 - 2508
  • [50] A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows
    Wu, Hongguang
    Gao, Yuelin
    Wang, Wanting
    Zhang, Ziyu
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (03) : 2491 - 2508