An Improved Ant Colony Algorithm for Open Vehicle Routing Problem with Time Windows

被引：3
|
作者：
Li Guiyun [1 ]
机构：
[1] Hunan Univ, Coll Econ & Trade, Changsha 410079, Hunan, Peoples R China
来源：
2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 2, PROCEEDINGS | 2009年
关键词：
open vehicle routing problem; improved ant colony algorithm (IACA); integer programming; logistics distribution;
D O I：
10.1109/ICIII.2009.307
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve OVRPTW effectively.
引用
收藏
页码：616 / 619
页数：4
相关论文
共 50 条
  • [1] Improved ant colony algorithm for solving vehicle routing problem with time windows
    Li, Lin
    Liu, Shi-Xin
    Tang, Jia-Fu
    [J]. Kongzhi yu Juece/Control and Decision, 2010, 25 (09): : 1379 - 1383
  • [2] A hybrid ant colony algorithm for vehicle routing problem with time windows
    Department of Logistics, Yunnan University of Finance and Economics, Kunming, China
    [J]. Ran, W., 1600, Asian Network for Scientific Information (12):
  • [3] Mixed ant colony algorithm for vehicle routing problem with time windows
    Wang, Jian
    Li, Hongyun
    Chen, Hong
    [J]. MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 855 - 858
  • [4] Improved ant colony optimization algorithm for solving vehicle routing problem with soft time windows
    He M.
    Wei Z.
    Wu X.
    Peng Y.
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (03): : 1029 - 1039
  • [5] Hybrid ant colony algorithm based on vehicle routing problem with time windows
    Zhu, Yuhua
    Zhen, Tong
    [J]. 2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 50 - 53
  • [6] An Enhanced Ant Colony Optimization Algorithm for Vehicle Routing Problem with Time Windows
    Gupta, Ashima
    Saini, Sanjay
    [J]. 2017 NINTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING (ICOAC), 2017, : 267 - 274
  • [7] Hybrid Ant Colony Algorithm for the Vehicle Routing with Time Windows
    Zhen, Tong
    Zhang, Qiuwen
    Zhang, Wenshuai
    Ma, Zhi
    [J]. 2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL 1, PROCEEDINGS, 2008, : 8 - +
  • [8] An improved ant colony optimization and its application to vehicle routing problem with time windows
    Ding, Qiulei
    Hu, Xiangpei
    Sun, Lijun
    Wang, Yunzeng
    [J]. NEUROCOMPUTING, 2012, 98 : 101 - 107
  • [9] Researvh on Vehicle Routing Problem with Time Windows Based on Improving Ant Colony Algorithm
    Li Guiyun
    [J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 415 - 418
  • [10] Improved Ant Colony Algorithm for Logistics Vehicle Routing Problem with Time Window
    Wang, Jian
    Wang, Yanyan
    Li, Hongyun
    [J]. EMERGING RESEARCH IN ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, 2012, 315 : 41 - 48
12345