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 条
  • [41] A Modified Ant Colony Algorithm for Vehicle Routing Problem
    Yu, Shanshan
    Xiang, Xiaolin
    EBM 2010: INTERNATIONAL CONFERENCE ON ENGINEERING AND BUSINESS MANAGEMENT, VOLS 1-8, 2010, : 2631 - 2635
  • [42] An improved ant colony optimization and its application to vehicle routing problem with time windows
    Ding, Qiulei
    Hu, Xiangpei
    Sun, Lijun
    Wang, Yunzeng
    NEUROCOMPUTING, 2012, 98 : 101 - 107
  • [43] HYBRIDIZING ANT COLONY SYSTEMS AND TABU SEARCH FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
    Carlos Figueroa, Juan D.
    Angelica Pinninghoff J, M.
    Contreras A, Ricardo
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 469 - 472
  • [44] An Ant Colony Algorithm for Capacitated Vehicle Routing Problem
    Ni, Qiu-ping
    Tang, Yuan-xiang
    Shi, Li-yao
    3RD INTERNATIONAL CONFERENCE ON SOCIAL SCIENCE AND MANAGEMENT (ICSSM 2017), 2017, : 570 - 575
  • [45] Two-Generation Ant Colony System for Vehicle Routing Problem with Time Windows
    Gong, Weiwei
    Liu, Xue
    Zhang, Jian
    Fu, Zetian
    2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 1917 - +
  • [46] Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System
    Necula, Raluca
    Breaban, Mihaela
    Raschip, Madalina
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 2480 - 2487
  • [47] Study on the Vehicle Routing Problem Based on the Improved Ant Colony Algorithm
    Du Hongwei
    Zhang Lihua
    Zhao Chunli
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INNOVATION AND MANAGEMENT, VOLS I AND II, 2009, : 1349 - 1354
  • [48] 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
  • [49] 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
  • [50] Application of Artificial Bee Colony Algorithm in Vehicle Routing Problem with Time Windows
    Chen, Cong
    Zhou, Kang
    2018 INTERNATIONAL CONFERENCE ON SENSING, DIAGNOSTICS, PROGNOSTICS, AND CONTROL (SDPC), 2018, : 781 - 785
12345