Journal of Applied Mathematics

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Yingcheng Xu, Li Wang, and Yuexiang Yang

Full-text: Open access

Abstract

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.

Article information

Source
J. Appl. Math., Volume 2013 (2013), Article ID 672078, 12 pages.

Dates
First available in Project Euclid: 14 March 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1394807855

Digital Object Identifier
doi:10.1155/2013/672078

Mathematical Reviews number (MathSciNet)
MR3032244

Zentralblatt MATH identifier
1268.90005

Citation

Xu, Yingcheng; Wang, Li; Yang, Yuexiang. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm. J. Appl. Math. 2013 (2013), Article ID 672078, 12 pages. doi:10.1155/2013/672078. https://projecteuclid.org/euclid.jam/1394807855


Export citation

References

  • P. Hansen and N. Mladenović, “Variable neighborhood search for the p-median,” Location Science, vol. 5, no. 4, pp. 207–226, 1997.
  • P. Hansen, N. Mladenović, and D. Perez-Britos, “Variable neighborhood decomposition search,” Journal of Heuristics, vol. 7, no. 4, pp. 335–350, 2001.
  • M. Gendreau and J.-Y. Potvin, “Dynamic vehicle routing and dispatching,” in Fleet Management and Logistic, T. G. Crainic and G. Laporte, Eds., pp. 115–226, Kluwer Academic, 1998.
  • B. Fleischmann, S. Gnutzmann, and E. Sandvoß, “Dynamic vehicle routing based on online traffic information,” Transportation Science, vol. 38, no. 4, pp. 420–433, 2004.
  • J. Yang, P. Jaillet, and H. Mahmassani, “Real-time multivehicle truckload pickup and delivery problems,” Transportation Science, vol. 38, no. 2, pp. 135–148, 2004.
  • R. Montemanni, L. M. Gambardella, A. E. Rizzoli, and A. V. Donati, “Ant colony system for a dynamic vehicle routing problem,” Journal of Combinatorial Optimization, vol. 10, no. 4, pp. 327–343, 2005.
  • M. Gendreau, F. Guertin, J. Y. Potvin, and R. Séguin, “Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries,” Transportation Research C, vol. 14, no. 3, pp. 157–174, 2006.
  • A. Goel and V. Gruhn, “Solving a dynamic real-life vehicle routing problem,” Operations Research Proceedings, vol. 2005, no. 8, pp. 367–372, 2006.
  • J. Schönberger and H. Kopfer, “Online decision making and automatic decision model adaptation,” Computers and Operations Research, vol. 36, no. 6, pp. 1740–1750, 2009.
  • C. Novoa and R. Storer, “An approximate dynamic programming approach for the vehicle routing problem with stochastic demands,” European Journal of Operational Research, vol. 196, no. 2, pp. 509–515, 2009.
  • R. M. Branchini, V. A. Armentano, and A. Løkketangen, “Adaptive granular local search heuristic for a dynamic vehicle routing problem,” Computers and Operations Research, vol. 36, no. 11, pp. 2955–2968, 2009.
  • J. Müller, “Approximative solutions to the bicriterion vehicle routing problem with time windows,” European Journal of Operational Research, vol. 202, no. 1, pp. 223–231, 2010.
  • O. Bräysy, “A reactive variable neighborhood search for the vehicle-routing problem with time windows,” INFORMS Journal on Computing, vol. 15, no. 4, pp. 347–368, 2003.
  • M. Polacek, R. F. Hartl, K. Doerner, and M. Reimann, “A variable neighborhood search for the multi depot vehicle routing problem with time windows,” Journal of Heuristics, vol. 10, no. 6, pp. 613–627, 2004.
  • J. Kytöjoki, T. Nuortio, O. Bräysy, and M. Gendreau, “An effi-cient variable neighborhood search heuristic for very large scale vehicle routing problems,” Computers and Operations Research, vol. 34, no. 9, pp. 2743–2757, 2007.
  • A. Goel and V. Gruhn, “A general vehicle routing problem,” European Journal of Operational Research, vol. 191, no. 3, pp. 650–660, 2008.
  • V. C. Hemmelmayr, K. F. Doerner, and R. F. Hartl, “A variable neighborhood search heuristic for periodic routing problems,” European Journal of Operational Research, vol. 195, no. 3, pp. 791–802, 2009.
  • K. Fleszar, I. H. Osman, and K. S. Hindi, “A variable neighbourhood search algorithm for the open vehicle routing problem,” European Journal of Operational Research, vol. 195, no. 3, pp. 803–809, 2009.
  • A. Larsen, “The dynamic vehicle routing problem,” IMM, DTU, 2001.
  • G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964.
  • É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J. Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, vol. 31, no. 2, pp. 170–186, 1997.
  • Z. Wang, J. Zhang, and X. Wang, “A modified variable neighborhood search algorithm for multi depot vehicle routing problem with time windows,” Chinese Journal of Management Science, vol. 19, no. 2, pp. 99–108, 2011.
  • M. Gendreau, A. Hertz, G. Laporte, and M. Stan, “A generalized insertion heuristic for the traveling salesman problem with time windows,” Operations Research, vol. 46, no. 3, pp. 330–335, 1998.
  • S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983.
  • W. Xu, G. Xianlong, and D. Ying, “Research on dynamic vehicle routing problem based on two-phase algorithm,” Control and Decision, vol. 27, no. 2, pp. 175–181, 2012.