Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance

  • Yujie Chen
  • Peter Cowling
  • Stephen Remde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8600)


This paper presents a case study of a real world storm drain maintenance problem where we must construct daily routes for a maintenance vehicle while considering the dynamic condition and social value of drains. To represent our problem, a dynamic period vehicle routing problem with profit (DPVRPP) model is proposed. This differs from the classical period routing problem in a number of ways. Firstly, it is dynamic: during the planning horizon, the demands from damaged drains and residents reports arrive continuously. In addition, the drains condition is changing over time. Secondly, our objective is maximizing the profit, defined here as the drains condition with respect to its social value.

This study is based on large-scale data provided by Gaist Solutions Ltd. and the council of a UK town (Blackpool). We propose an adaptive planning heuristic (APH) that produces daily routes based on our model and an estimation of changing drain condition in the future. Computational results show that the APH approach can, within reasonable CPU time, produce much higher quality solutions than the scheduling strategy currently implemented by Blackpool council.


Planning Horizon Variable Neighbourhood Search Vehicle Rout Problem Dynamic Period Candidate Route 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Christofides, N., Beasley, J.E.: The period routing problem. Networks 14(2), 237–256 (1984)CrossRefzbMATHGoogle Scholar
  2. 2.
    Ball, M.O.: Allocation/routing: Models and algorithms. In: Golden, B.L., Assad, A. (eds.) Vehicle Routing: Methods and Studies, pp. 194–221 (1988)Google Scholar
  3. 3.
    Chao, I.M., Golden, B.L., Wasil, E.: An improved heuristic for the period vehicle routing problem. Networks 26(1), 25–44 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)CrossRefzbMATHGoogle Scholar
  5. 5.
    Brandão, J., Mercer, A.: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100(1), 180–191 (1997)CrossRefzbMATHGoogle Scholar
  6. 6.
    Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur. J. Oper. Res. 179(3), 736–746 (2007)CrossRefzbMATHGoogle Scholar
  7. 7.
    Delgado, C., Laguna, M., Pacheco, J.: Minimizing labor requirements in a periodic vehicle loading problem. Comput. Optim. Appl. 32(3), 299–320 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Hemmelmayr, V., Doerner, K., Hartl, R.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791–802 (2009)CrossRefzbMATHGoogle Scholar
  9. 9.
    Pirkwieser, S., Raidl, G.R.: Multilevel variable neighborhood search for periodic routing problems. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 226–238. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Baptista, S., Oliveira, R., Zúquete, E.: A period vehicle routing case study. Eur. J. Oper. Res. 139, 220–229 (2002)CrossRefzbMATHGoogle Scholar
  11. 11.
    Goncalves, L., Ochi, L., Martins, S.: A grasp with adaptive memory for a period vehicle routing problem. In: Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, vol. 1, pp. 721–727 (2005)Google Scholar
  12. 12.
    Angelelli, E., Speranza, M., Savelsbergh, M.: Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4), 308–317 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Angelelli, E., Bianchessi, N., Mansini, R., Speranza, M.: Short Term Strategies for a Dynamic Multi-Period Routing Problem. Transportation Research Part C: Emerging Technologies 17(2), 106–119 (2009)CrossRefGoogle Scholar
  14. 14.
    Wen, M., Cordeau, J.F., Laporte, G., Larsen, J.: The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37(9), 1615–1623 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Weibull, W.: A statistical distribution function of wide applicability. Journal of Applied Mechanics 18, 293–297 (1951)zbMATHGoogle Scholar
  16. 16.
    Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4), 568–581 (1964)CrossRefGoogle Scholar
  17. 17.
    Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24, 1097–1100 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4, 387–411 (1992)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Yujie Chen
    • 1
  • Peter Cowling
    • 1
  • Stephen Remde
    • 1
  1. 1.York Centre for Complex Systems Analysis (YCCSA) and Dept. of Computer ScienceUniversity of YorkUK

Personalised recommendations