Skip to main content
SpringerLink
Log in

OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

In open vehicle routing problem (OVRP), after delivering service to the last customer, the vehicle does not necessarily return to the initial depot. This type of problem originally defined about thirty years ago and still is an open issue. In real life, the OVRP is similar to the delivering newspapers and consignments. The problem of service delivering to a set of customers is a particular open VRP with an identical fleet for transporting vehicles that do not necessarily return to the initial depot. Contractors which are not the employee of the delivery company use their own vehicles and do not return to the depot. Solving the OVRP means to optimize the number of vehicles, the traveling distance and the traveling time of a vehicle. In time, several algorithms such as tabu search, deterministic annealing and neighborhood search were used for solving the OVRP. In this paper, a new combinatorial algorithm named OVRP_GELS based on gravitational emulation local search algorithm for solving the OVRP is proposed. We also used record-to-record algorithm to improve the results of the GELS. Several numerical experiments show a good performance of the proposed method for solving the OVRP when compared with existing techniques.

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.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34:2918–2930

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Csiszár S (2005) Route elimination heuristic for vehicle routing problem with time windows. acta polytech hung 2(2):77–89

    Google Scholar 

  4. Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband Sh, Abraham A (2015) Gravitational search algorithm to solve open vehicle routing problem. In: 6th International conference on innovations in bio-inspired computing and applications (IBICA 2015), chapter advances in intelligent systems and computing, Kochi, India, Springer, pp 93–103

  5. Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51:564–573

    Article  MATH  Google Scholar 

  6. Brandao J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157:552–564

    Article  MathSciNet  MATH  Google Scholar 

  7. Erbao C, Mingyong L, Hongming Y (2013) Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst Appl 41:3569–3575

    Google Scholar 

  8. Yu Sh, Ding Ch, Zhu K (2011) A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material. Expert Syst Appl 38:10568–10573

    Article  Google Scholar 

  9. Li X, Leung SCH, Tian P (2012) A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle, routing problem. Expert Syst Appl 39:365–374

    Article  Google Scholar 

  10. Huang F, Liu C (2010) A hybrid tabu search for open vehicle routing problem. CCTAE 1:132–134

    Google Scholar 

  11. Huang F, Liu C (2010) An Improved tabu search for open vehicle routing problem. MASS, pp 1–4

  12. Shamshirband S, Shojafar M, Hosseinabadi AR, Abraham A (2014) A solution for multi-objective commodity vehicle routing problem by NSGA-II. In: International conference on hybrid intelligent systems (HIS), pp 12–17

  13. Hadji SKh, Prins Ch, Yalaoui A, Reghioui M (2013) Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Central Eur J Oper Res 21(2):307–336

    Article  MathSciNet  Google Scholar 

  14. Norouzi N, Tavakkoli-Moghaddam R, Salamatbakhsh A, Alinaghian M (2009) Solving a novel bi-objective open vehicle routing problem in a competitive situation by multi objective particle swarm optimization. J Appl Oper Res 1:15–29

    MATH  Google Scholar 

  15. Zhen T, Zhu Y, Zhang Q (2009) A particle swarm optimization algorithm for the open vehicle routing problem. ESIAT 2:560–563

    Google Scholar 

  16. Hu F, Wu F (2010) Diploid hybrid particle swarm optimization with differential evolution for open vehicle routing problem. WCICA, pp 2692–2697

  17. Mirhassani SA, Abolghasemi N (2011) A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst Appl 38:11547–11551

    Article  Google Scholar 

  18. Ghosh T, Sengupta S, Chattopadhyay M, Dan PK (2011) Meta-heuristics in cellular manufacturing: a state-ofthe- art review. Int J Ind Eng Comput 2:87–122

    Google Scholar 

  19. Shamshirband Sh, Shojafar M, Hosseinabadi AR, Abraham A (2015) OVRP_ICA: An Imperialist-based optimization algorithm for the open vehicle routing problem. In: International conference on hybrid artificial intelligence systems (HAIS), Springer LNCS, vol 9121, pp 221–233

  20. Pan L, Fu Z (2009) A clonal selection algorithm for open vehicle routing problem. In: Third international conference on genetic and evolutionary computing, pp 786–790

  21. Voudouris C, Tsang E (1995) Function optimization using guided local search. Technical Report CSM-249, University of Essex, Colchester

  22. Webster B (2004) Solving combinatorial optimization problems using a new algorithm based on gravitational attraction. Melbourne

  23. Bagrezai A, Makki SVA-D, Rostami A (2013) A new energy consumption algorithm with active sensor selection using GELS in target coverage WSN. Int J Comput Sci Issues 10:11–18

    Google Scholar 

  24. Balachandar SR, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. Int J Comput Math Sci 4:223–228

    Google Scholar 

  25. Rezaeian J, Seidgar H, Kiani M (2013) Scheduling of a hybrid flow shop with multiprocessor tasks by a hybrid approach based on genetic and imperialist competitive algorithms. J Optim Ind Eng 6:1–11

    Google Scholar 

  26. Hosseinabadi AR, Siar H, Shamshirband S, Shojafar M, Nizam Md, Nasir MH (2015) Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises. Ann Oper Res 229(1):451–474

    Article  MathSciNet  MATH  Google Scholar 

  27. Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband S, Abraham A (2014) GELS-GA: hybrid metaheuristic algorithm for solving multiple travelling salesman problem. In: International conference on intelligent systems design and applications (ISDA), pp 76–81

  28. Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl Math Inf Sci 9(2):1–11

    MathSciNet  Google Scholar 

  29. Hosseinabadi AR, Farahabadi AB, Rostami MS, Lateran AF (2013) Presentation of a new and beneficial method through problem solving timing of open shop by random algorithm gravitational emulation local search. Int J Comput Sci Issues 10:745–752

    Google Scholar 

  30. Dueck G (1990) New optimization heuristics : the great deluge algorithm and the record-to-record travel. J Comput Phys 90:161–175

    Article  MathSciNet  Google Scholar 

  31. Li F, Golden B, Wasil E (2005) Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32:1165–1179

    Article  MATH  Google Scholar 

  32. Site: www.branchandcut.org/VRP/data/, http://people.brunel.ac.uk/mastjjb/jeb/info.htm

  33. Christofides N, Mingozzi A, Toth P The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 31538, 31979

  34. Fisher M (1994) Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, pp 626-642

  35. Schneider H, Reinholz A (2008) Integrating variable neighborhood search into a hybrid evolutionary strategy for the open vehicle routing problem. EU/MEeting 2008—Troyes, France, October 23_24, pp 1–6

  36. Repoussisa PP, Tarantilis CD, Braysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37:443–455

    Article  MathSciNet  MATH  Google Scholar 

  37. Zachariadis EE, Kiranoudis ChT (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput Oper Res 37:712–723

    Article  MATH  Google Scholar 

  38. Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol Comput 15:80–94

    Article  MATH  Google Scholar 

  39. Chen P, Qu Y, Huang H, Dong X (2008) A new hybrid iterated local search for the open vehicle routing problem. Pacific-Asia Workshop on Computational Intelligence and Industrial Application, pp 891–895

Download references

Author information

Authors and Affiliations

  1. Young Researchers and Elite Club, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran

    Ali Asghar Rahmani Hosseinabadi

  2. Iran University of Science and Technology, Tehran, Iran

    Javad Vahidi

  3. Aurel Vlaicu University, Bd. Revolutiei 77, 310130, Arad, Romania

    Valentina Emilia Balas

  4. Department of Computer Engineering and IT, Faculty of Computer Science, Payame Noor University, Tehran, Iran

    Seyed Saeid Mirkamali

Authors
  1. Ali Asghar Rahmani Hosseinabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javad Vahidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Valentina Emilia Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seyed Saeid Mirkamali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javad Vahidi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hosseinabadi, A.A.R., Vahidi, J., Balas, V.E. et al. OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput & Applic 29, 955–968 (2018). https://doi.org/10.1007/s00521-016-2608-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-016-2608-x

Keywords

Search

Navigation