Hybrid ant colony algorithm based on vehicle routing problem with time windows

被引:3
|
作者
Zhu, Yuhua [1 ]
Zhen, Tong [1 ]
机构
[1] Henan Univ Technol, Coll Informat Sci & Engn, Zhengzhou 45001, Peoples R China
来源
2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II | 2009年
关键词
Hybrid ant colony algorithm based; vehicle routing; time windows; optimization; OPTIMIZATION; SYSTEM;
D O I
10.1109/ICIE.2009.237
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
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.
引用
收藏
页码:50 / 53
页数:4
相关论文
共 50 条
  • [1] Research on Vehicle Routing Problem with Time Windows Based on Improved Genetic Algorithm and Ant Colony Algorithm
    Chen, Guangqiao
    Gao, Jun
    Chen, Daozheng
    ELECTRONICS, 2025, 14 (04):
  • [2] An Adaptive Variable Neighborhood Search Ant Colony Algorithm for Vehicle Routing Problem With Soft Time Windows
    He, Meiling
    Wei, Zhixiu
    Wu, Xiaohui
    Peng, Yongtao
    IEEE ACCESS, 2021, 9 : 21258 - 21266
  • [3] The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem
    Li, Yueli
    Ren, Ai-hua
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 4693 - 4696
  • [4] A hybrid algorithm for vehicle routing problem with time windows
    Yu, B.
    Yang, Z. Z.
    Yao, B. Z.
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (01) : 435 - 441
  • [5] A Hybrid Ant Colony Optimization and Its Application to Vehicle Routing Problem with Time Windows
    Hu, Xiangpei
    Ding, Qiulei
    Wang, Yunzeng
    LIFE SYSTEM MODELING AND INTELLIGENT COMPUTING, PT I, 2010, 97 : 70 - +
  • [6] The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem
    Li, Yueli
    Ren, Ai-hua
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 4005 - +
  • [7] 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):
  • [8] The Research on Vehicle Routing Problem based on Improved Ant Colony Algorithm
    Jiang, Zhengqiang
    Wu, Yue
    ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY III, PTS 1-4, 2013, 397-400 : 2439 - 2446
  • [9] Improved Ant Colony Algorithm for Logistics Vehicle Routing Problem with Time Window
    Wang, Jian
    Wang, Yanyan
    Li, Hongyun
    EMERGING RESEARCH IN ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, 2012, 315 : 41 - 48
  • [10] Improved artificial bee colony algorithm for vehicle routing problem with time windows
    Yao, Baozhen
    Yan, Qianqian
    Zhang, Mengjie
    Yang, Yunong
    PLOS ONE, 2017, 12 (09):