Skip to main content
SpringerLink
Log in

Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows

  • Conference paper
  • First Online:
Computational Aspects and Applications in Large-Scale Networks (NET 2016)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 247))

Included in the following conference series:

Abstract

The paper presents a tabu search heuristic for the Fleet Size and Mix Vehicle Routing Problem (FSMVRP) with hard and soft time windows. The objective function minimizes the sum of travel costs, fixed vehicle costs, and penalties for soft time window violations. The algorithm is based on the tabu search with several neighborhoods. The main contribution of the paper is the efficient algorithm for a real-life vehicle routing problem. To the best of our knowledge, there are no papers devoted to the FSMVRP problem with soft time windows, while in real-life problems, this is a usual case. We investigate the performance of the proposed heuristic on the classical Solomon instances with additional constraints. We also compare our approach without soft time windows and heterogeneous fleet of vehicles with the recently published results on the VRP problem with hard time windows.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Lokketangen, A.: Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37(9), 1515–1536 (2010)

    Article  MathSciNet  Google Scholar 

  2. Braysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)

    Article  Google Scholar 

  3. Buhrkala, K., Larsena, A., Ropkea, S.: The waste collection vehicle routing problem with time windows in a city logistics context. Soc. Behav. Sci. 39, 241–254 (2012)

    Article  Google Scholar 

  4. Burchett, D., Campion, E.: Mix fleet vehicle routing problem—An application of Tabu search in the grocery delivery industry. Manag. Sci. Honor. Proj. (2002)

    Google Scholar 

  5. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928–936 (2001)

    Article  Google Scholar 

  6. Czech, Z.J., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Canary Islands, Spain, pp. 376–383 (2002)

    Google Scholar 

  7. Dullaert, W., Janssens, G., Sorensen, K., Vernimmen, B.: New heuristics for the fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 53, 1232–1238 (2002)

    Google Scholar 

  8. Feillet, D., Garaix, T., Lehuede, F., Peton, O., Quadri, D.: A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63(3), 211–224 (2014)

    Article  MathSciNet  Google Scholar 

  9. Figliozzi, M.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp. Res. Part C 18, 668–679 (2010)

    Article  Google Scholar 

  10. Gendreau, M., Tarantilis, C.: Solving large-scale vehicle routing problems with time windows: the state-of-the-art. Technical Report 2010–04, CIRRELT, Montreal, Canada (2010)

    Google Scholar 

  11. Golden, B., Assad, A., Levy, L., Gheysens, E.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49–66 (1984)

    Article  Google Scholar 

  12. Hedar, A., Bakr, M.: Three strategies Tabu search for vehicle routing problem with time windows. Comput. Sci. Inf. Technol. 2(2), 108–119 (2014)

    Google Scholar 

  13. Hwang, H.S.: An improved model for vehicle routing problem with time constraint based on genetic algorithm. Comput. Ind. Eng. pp. 1–9. (2002)

    Google Scholar 

  14. Iqbal, S., Rahman, M.: Vehicle routing problems with soft time windows. In: 7th International Conference on IEEE Electrical & Computer Engineering (ICECE), pp. 634–638. https://doi.org/10.1109/icece.2012.6471630

  15. Jawarneh, S., Abdullah, S.: Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows. PLoS ONE 10, 1–23 (2015)

    Article  Google Scholar 

  16. Koc, C., Bektas, T., Jabali, O., Laporte, G.: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res. 64, 11–27 (2015)

    Article  MathSciNet  Google Scholar 

  17. Koc, C., Bektas, T., Jabalib, O., Laporte, G.: A hybrid evolutionary algorithm for heterogeneous? fleet vehicle routing problems with time windows. Comput. Oper. Res. 64, 11–27 (2015)

    Article  MathSciNet  Google Scholar 

  18. Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1992)

    Article  Google Scholar 

  19. Liu, F.-H., Shen, S.-Y.: The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50(7), 721–732 (1999)

    Article  Google Scholar 

  20. Minocha, B., Tripathi, S.: Solving school bus routing problem using hybrid genetic algorithm: a case study. Adv. Intell. Syst. Comput. 236, 93–103 (2014)

    Article  Google Scholar 

  21. Moccia, L., Cordeau, J.F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. Technical Report, https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2010-12.pdf (2010)

  22. Mouthuy, S., Massen, F., Deville, Y.: A multi-stage very large-scale neighborhood search for the vehicle routing problem with soft time-windows. Transp. Sci. 49(2), 223–238 (2015)

    Article  Google Scholar 

  23. Mutingi, M., Mbohwa, C.: A group genetic algorithm for the fleet size and mix vehicle routing problem. IEEE Conference on Industrial Engineering and Management, Hong Kong (2012)

    Google Scholar 

  24. Nai-Wen, L., Chang-Shi, L.: A hyrid tabu search for the vehicle routing problem with soft time windows. In: Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering, vol. 181, pp. 507–512 (2012)

    Google Scholar 

  25. Niroomand, I., Khataie, A.H., Galankashi, M.R.: Vehicle routing with time window for regional network services. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 903–907 (2014)

    Google Scholar 

  26. Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant colony optimization for real-world vehicle routing problems. Swarm Intell. 1(2), 135–151 (2007)

    Article  Google Scholar 

  27. Rousseau, L.M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with constraint programming based column generation. Ann. Oper. Res. 130, 199–216 (2004)

    Article  MathSciNet  Google Scholar 

  28. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  Google Scholar 

  29. Subramanian, A., Penna, P., Uchoa, E., Ochi, L.: A hybrid algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 221(2), 285–295 (2012)

    Article  Google Scholar 

  30. Suthikarnnarunai, N.: A sweep algorithm for the mix fleet vehicle routing problem. Lect. Note Eng. Comput. Sci. 2169(1), 1914–1919 (2008)

    Google Scholar 

Download references

Acknowledgements

The research was funded by Russian Science Foundation (RSF Project No. 17-71-10107).

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, 136 Rodionova, 603093, Nizhny Novgorod, Russia

    Mikhail Batsyn, Ilya Bychkov, Larisa Komosko & Alexey Nikolaev

Authors
  1. Mikhail Batsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilya Bychkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Larisa Komosko
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexey Nikolaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikhail Batsyn .

Editor information

Editors and Affiliations

  1. Higher School of Economics, National Research University, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  3. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania, USA

    Oleg Prokopyev

  4. Higher School of Economics, National Research University, Nizhny Novgorod, Russia

    Irina Utkina

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Batsyn, M., Bychkov, I., Komosko, L., Nikolaev, A. (2018). Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows. In: Kalyagin, V., Pardalos, P., Prokopyev, O., Utkina, I. (eds) Computational Aspects and Applications in Large-Scale Networks. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 247. Springer, Cham. https://doi.org/10.1007/978-3-319-96247-4_1

Download citation

Publish with us

Policies and ethics

Search

Navigation