Skip to main content
SpringerLink
Log in

A multi-start ILS–RVND algorithm with adaptive solution acceptance for the CVRP

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This study proposes a novel hybrid algorithm based on Iterated Local Search (ILS) and Random Variable Neighborhood Descent (RVND) metaheuristics for the purpose of solving the Capacitated Vehicle Routing Problem (CVRP). The main contribution of this work is that two new search rules have been developed for multi-starting and adaptive acceptance strategies, and applied together to enhance the power of the algorithm. A comprehensive experimental work has been conducted on two common CVRP benchmarks. Computational results demonstrate that both multi-start and adaptive acceptance strategies provide a significant improvement on the performance of pure ILS–RVND hybrid. Experimental work also shows that our algorithm is highly effective in solving CVRP and comparable with the state of the art.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Agrawal V, Lightner C, Lightner-Laws C, Wagner N (2017) A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem. Soft Comput 21(17):5159–5178

    Article  Google Scholar 

  • Alabas-Uslu C, Dengiz B (2011) A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst Appl 38(7):8990–8998

    Article  Google Scholar 

  • Avci M, Topaloglu S (2015) An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput Ind Eng 83:15–29

    Article  Google Scholar 

  • Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315–338

    MATH  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581

    Article  Google Scholar 

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80–91

    Article  MathSciNet  Google Scholar 

  • Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23(1):79–96

    Article  MathSciNet  Google Scholar 

  • Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161–175

    Article  MathSciNet  Google Scholar 

  • Fu Z, Eglese R, Li LYO (2005) A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 56(3):267–274

    Article  Google Scholar 

  • Gee SB, Arokiasami WA, Jiang J, Tan KC (2016) Decomposition-based multi-objective evolutionary algorithm for vehicle routing problem with stochastic demands. Soft Comput 20(9):3443–3453

    Article  Google Scholar 

  • Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467

    Article  MathSciNet  Google Scholar 

  • Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33(8):2405–2429

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

  • Lenstra JK, Kan AR (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227

    Article  Google Scholar 

  • López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43–58

    Article  MathSciNet  Google Scholar 

  • Michallet J, Prins C, Amodeo L, Yalaoui F, Vitry G (2014) Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput Oper Res 41:196–207

    Article  MathSciNet  Google Scholar 

  • Molina J, López-Sánchez A, Hernández-Díaz AG, Martínez-Salazar I (2018) A multi-start algorithm with intelligent neighborhood selection for solving multi-objective humanitarian vehicle routing problems. J Heuristics 24(2):111–133

    Article  Google Scholar 

  • Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20(6):2309–2327

    Article  Google Scholar 

  • Penna PHV, Subramanian A, Ochi LS (2013) An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J Heuristics 19(2):201–232

    Article  Google Scholar 

  • Psychas ID, Marinaki M, Marinakis Y, Migdalas A (2017) Parallel multi-start nondominated sorting particle swarm optimization algorithms for the minimization of the route-based fuel consumption of multiobjective vehicle routing problems. In: Butenko S, Pardalos PM, Shylo V (eds) Optimization methods and applications. Springer, Berlin, pp 425–456

    Chapter  Google Scholar 

  • Rivera JC, Afsar HM, Prins C (2015) A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Comput Optim Appl 61(1):159–187

    Article  MathSciNet  Google Scholar 

  • Sassi O, Cherif-Khettaf WR, Oulamara A (2015) Multi-start iterated local search for the mixed fleet vehicle routing problem with heterogenous electric vehicles. In: European conference on evolutionary computation in combinatorial optimization. Springer, pp 138–149

  • Stützle T (1998) Local search algorithms for combinatorial problems. Dissertation, Darmstadt University of Technology

  • Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519–2531

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Tarantilis C, Kiranoudis C, Vassiliadis V (2002) A backtracking adaptive threshold accepting algorithm for the vehicle routing problem. Syst Anal Model Simul 42(5):631–664

    Article  MathSciNet  Google Scholar 

  • Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845–858

    Article  MathSciNet  Google Scholar 

  • Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611–624

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Author Osman Gokalp acknowledges the support of Scientific and Technological Research Council of Turkey (TUBITAK) 2211 National Graduate Scholarship Program.

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Ege University, 35100, Bornova, Izmir, Turkey

    Osman Gokalp & Aybars Ugur

Authors
  1. Osman Gokalp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aybars Ugur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Osman Gokalp.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gokalp, O., Ugur, A. A multi-start ILS–RVND algorithm with adaptive solution acceptance for the CVRP. Soft Comput 24, 2941–2953 (2020). https://doi.org/10.1007/s00500-019-04072-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04072-6

Keywords

Search

Navigation