Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 672078, 12 pages
Research Article

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

1Branch of Quality Management, China National Institute of Standardization, Beijing 100088, China
2Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
3School of Economics and Management, Beihang University, Beijing 100191, China

Received 14 September 2012; Revised 5 December 2012; Accepted 25 December 2012

Academic Editor: Qiuhong Zhao

Copyright © 2013 Yingcheng Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.