Skip to main content
SpringerLink
Log in

An Investigation on Compound Neighborhoods for VRPTW

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 695))

Included in the following conference series:

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time intervals and capacity constraints. A Variable Neighbourhood Search algorithm which can simultaneously optimize both objectives of VRPTW (to minimize the number of vehicles and the total travel distance) is proposed in this paper. The three compound neighbourhood operators are developed with regards to problem characteristics of VRPTW. Compound neighbourhoods combine a number of independent neighbourhood operators to explore a larger scale of neighbourhood search space. Performance of these operators has been investigated and is evaluated on benchmark problems.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1992)

    Article  MATH  Google Scholar 

  2. Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: VRP with time windows. In: The vehicle routing problem, Society for Industrial and Applied Mathematics, pp. 157–193 (2001)

    Google Scholar 

  3. Bräysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15, 347–368 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ghoseiri, K., Ghannadpour, S.F.: Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 10, 1096–1107 (2010)

    Article  Google Scholar 

  5. Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189, 293–309 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Bräysy, O., Gendreau, M.: Metaheuristics for the vehicle routing problem with time windows. Report STF42 A 1025 (2001)

    Google Scholar 

  8. Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS J. Comput. 8, 158–164 (1996)

    Article  MATH  Google Scholar 

  9. Van Breedam, A.: Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur. J. Oper. Res. 86, 480–490 (1995)

    Article  MATH  Google Scholar 

  10. Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hansen, P., Mladenović, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34, 405–413 (2001)

    Article  MATH  Google Scholar 

  13. Hansen, P., Mladenović, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7, 335–350 (2001)

    Article  MATH  Google Scholar 

  14. Hansen, P., Mladenović, N., Urośević, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33, 3034–3045 (2006)

    Article  MATH  Google Scholar 

  15. Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10, 613–627 (2004)

    Article  Google Scholar 

  16. Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195, 803–809 (2009)

    Article  MATH  Google Scholar 

  17. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791–802 (2009)

    Article  MATH  Google Scholar 

  18. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  19. Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University Microfilms (1976)

    Google Scholar 

  20. Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421–451 (1993)

    Article  MATH  Google Scholar 

  21. Taillard, A., Badeau, P., Gendreau, M., Guertin, F.A., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997)

    Article  MATH  Google Scholar 

  22. Ergun, Ö., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves. J. Heuristics 12, 115–140 (2006)

    Article  MATH  Google Scholar 

  23. Rego, C.: A subpath ejection method for the vehicle routing problem. Manag. Sci. 44, 1447–1459 (1998)

    Article  MATH  Google Scholar 

  24. Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86–92 (1993)

    Article  MATH  Google Scholar 

  25. SINTEF: Best known solution values for solomon benchmark (2015). http://www.sintef.no/Projectweb/TOP/VRPTW/Solomon-benchmark/100-customers/

  26. Alvarenga, G.B., Mateus, G.R., De Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34, 1561–1584 (2007)

    Article  MATH  Google Scholar 

  27. Tan, K., Chew, Y., Lee, L.: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34, 115–151 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  28. Küçükoğlu, İ., Öztürk, N.: An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Comput. Ind. Eng. 86, 60–68 (2014)

    Google Scholar 

  29. Kallehauge, B., Larsen, J., Madsen, O.B.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33, 1464–1487 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  30. Cook, W., Rich, J.L.: A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical report (1999)

    Google Scholar 

  31. Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24, 17–30 (2006)

    Article  Google Scholar 

  32. Chiang, W.C., Russell, R.A.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9, 417–430 (1997)

    Article  MATH  Google Scholar 

  33. Rochat, Y., Taillard, É.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)

    Article  MATH  Google Scholar 

  34. Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11, 5375–5390 (2011)

    Article  Google Scholar 

Download references

Acknowledgement

This research was supported by Royal Society International Exchanges Scheme, National Natural Science Foundation of China (NSFC 71471092, NSFC-RS 713 11130142), Ningbo Sci&Tech Bureau (2014A35006), Department of Education Fujian Province (JB14223) and School of Computer Science at the University of Nottingham.

Author information

Authors and Affiliations

  1. University of Nottingham, Nottingham, UK

    Binhui Chen & Rong Qu

  2. University of Nottingham Ningbo, Ningbo, China

    Ruibin Bai

  3. Osaka Prefecture University, Osaka, Japan

    Hisao Ishibuchi

Authors
  1. Binhui Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ruibin Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hisao Ishibuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Binhui Chen .

Editor information

Editors and Affiliations

  1. Complutense University, Madrid, Spain

    Begoña Vitoriano

  2. INFORMS, Catonsville, Maryland, USA

    Greg H. Parlier

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chen, B., Qu, R., Bai, R., Ishibuchi, H. (2017). An Investigation on Compound Neighborhoods for VRPTW. In: Vitoriano, B., Parlier, G. (eds) Operations Research and Enterprise Systems. ICORES 2016. Communications in Computer and Information Science, vol 695. Springer, Cham. https://doi.org/10.1007/978-3-319-53982-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53982-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53981-2

  • Online ISBN: 978-3-319-53982-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation