A Hybrid Algorithm for Vehicle Routing Problem with Time Windows

Authors:
Dengying Jiang;Wenxia Jiang;Zhangcan Huang
Affiliations:
School of Science, Wuhan University of Technology, Wuhan, China 430070;School of Science, Wuhan University of Technology, Wuhan, China 430070;School of Science, Wuhan University of Technology, Wuhan, China 430070
Venue:
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Year:
2008

Citing 5
Cited 0

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

Operations Research
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Hierarchical Tournament Selection Genetic Algorithm for the Vehicle Routing Problem with Time Windows

HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems
A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows

HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The VRPTW is a well-known and complex combinatorial problem which has considerable attention in recent years. Combinatorial optimization problems of this kind are NP-hard and are best solved to near optimum by heuristics. Here, we propose a two-stage optimization strategy for VRPTW. Firstly, for constructing a good initial solution, we use the stochastic PFIH, guaranteeing the diversity of the initial solution. And then a hybrid system based on the combination of SA and LNS is proposed to optimize the initial solution. Secondly, tune time windows for the customers using a regression iterative strategy which is put forward to and figure out the optimum time for each vehicle departing. It can make the total waiting time zero. The test of this work is executed over the type C101 in Solomon's VRPTW instances. It is proved by the experiment that our algorithm can solve VRPTW efficiently and quickly.