A Hybrid Intelligent Algorithm for the Vehicle Routing with Time Windows

Authors:
Qiuwen Zhang;Tong Zhen;Yuhua Zhu;Wenshuai Zhang;Zhi Ma
Affiliations:
College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China 450001;College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China 450001;College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China 450001;Henan Vocational College of Agriculture, Zhongmu, China 451450;College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China 450001
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Year:
2008

Citing 5
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Ant algorithms for discrete optimization

Artificial Life
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models with time windows and its hybrid intelligent algorithm. 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 intelligent algorithm base on dynamic sweep and ant colony algorithm (DSACA-VRPTW) is proposed to solve this problem. Firstly, each ant's solution might be improved by dynamic sweep algorithm. Then a new improved ant colonies technique is proposed for it. 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.