Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clus...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Applied Mathematics 2013-01, Vol.2013 (2013), p.654-665-572
Main Authors: Xu, Yingcheng, Wang, Li, Yang, Yuexiang
Format: Article
Language:English
Subjects:
Algorithms
Dynamics
Engineering research
Mathematical models
Mathematical research
Mobile communication systems
Position (location)
Route selection
Search algorithms
Vehicles
Windows (intervals)
Wireless communication systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.
ISSN:1110-757X
1687-0042
DOI:10.1155/2013/672078