Hybrid Ant Colony Algorithm for the Vehicle Routing with Time Windows

被引:6
|
作者
Zhen, Tong [1 ]
Zhang, Qiuwen [1 ]
Zhang, Wenshuai [2 ]
Ma, Zhi [1 ]
机构
[1] Henan Univ Technol, Coll Informat Sci & Engn, Zhengzhou 450001, Peoples R China
[2] Henan Vocat Coll Agr, Zhongmu 451450, Peoples R China
关键词
D O I
10.1109/CCCM.2008.85
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each ant's solution might be improved by dynamic sweep Algorithm which makes improvement to the solutions by grouping the customers. Then a new improved ant colonies technique is proposed, after all colonies are in the state of stagnation, communication among them is carried out in order to do favor to leave the local peaks. Finally, Solomon's benchmark instances (VRPTW 100-customer) are tested for the algorithm and shows that the DSACA is able to find solutions for VRPTW
引用
收藏
页码:8 / +
页数:2
相关论文
共 50 条
  • [1] A hybrid ant colony algorithm for vehicle routing problem with time windows
    Department of Logistics, Yunnan University of Finance and Economics, Kunming, China
    Ran, W., 1600, Asian Network for Scientific Information (12):
  • [2] Hybrid ant colony algorithm based on vehicle routing problem with time windows
    Zhu, Yuhua
    Zhen, Tong
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 50 - 53
  • [3] Mixed ant colony algorithm for vehicle routing problem with time windows
    Wang, Jian
    Li, Hongyun
    Chen, Hong
    MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 855 - 858
  • [4] 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
  • [5] 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
  • [6] Improved ant colony algorithm for solving vehicle routing problem with time windows
    Li, Lin
    Liu, Shi-Xin
    Tang, Jia-Fu
    Kongzhi yu Juece/Control and Decision, 2010, 25 (09): : 1379 - 1383
  • [7] An Enhanced Ant Colony Optimization Algorithm for Vehicle Routing Problem with Time Windows
    Gupta, Ashima
    Saini, Sanjay
    2017 NINTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING (ICOAC), 2017, : 267 - 274
  • [8] An Improved Ant Colony Algorithm for Open Vehicle Routing Problem with Time Windows
    Li Guiyun
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 2, PROCEEDINGS, 2009, : 616 - 619
  • [9] Ant colony algorithm for allied vehicle routing problems with soft time windows
    Sch. of Automation, Guangdong Univ. of Tech., Guangzhou 510090, China
    Jisuanji Jicheng Zhizao Xitong, 2006, 11 (1903-1908):
  • [10] A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
    Zhang, Huizhen
    Zhang, Qinwan
    Ma, Liang
    Zhang, Ziying
    Liu, Yun
    INFORMATION SCIENCES, 2019, 490 : 166 - 190