Advertisement

Neural Computing and Applications

, Volume 29, Issue 10, pp 955–968 | Cite as

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

  • Ali Asghar Rahmani Hosseinabadi
  • Javad Vahidi
  • Valentina Emilia Balas
  • Seyed Saeid Mirkamali
Original Article

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.

Keywords

Open vehicle routing problem Gravitational emulation local search algorithm (GELS) Optimization Velocity Newton’s law Record-to-record algorithm 

References

  1. 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–2930CrossRefzbMATHGoogle Scholar
  2. 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–809CrossRefzbMATHGoogle Scholar
  3. 3.
    Csiszár S (2005) Route elimination heuristic for vehicle routing problem with time windows. acta polytech hung 2(2):77–89Google Scholar
  4. 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–103Google Scholar
  5. 5.
    Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51:564–573CrossRefzbMATHGoogle Scholar
  6. 6.
    Brandao J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157:552–564MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Erbao C, Mingyong L, Hongming Y (2013) Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst Appl 41:3569–3575Google Scholar
  8. 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–10573CrossRefGoogle Scholar
  9. 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–374CrossRefGoogle Scholar
  10. 10.
    Huang F, Liu C (2010) A hybrid tabu search for open vehicle routing problem. CCTAE 1:132–134Google Scholar
  11. 11.
    Huang F, Liu C (2010) An Improved tabu search for open vehicle routing problem. MASS, pp 1–4Google Scholar
  12. 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–17Google Scholar
  13. 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–336MathSciNetCrossRefGoogle Scholar
  14. 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–29zbMATHGoogle Scholar
  15. 15.
    Zhen T, Zhu Y, Zhang Q (2009) A particle swarm optimization algorithm for the open vehicle routing problem. ESIAT 2:560–563Google Scholar
  16. 16.
    Hu F, Wu F (2010) Diploid hybrid particle swarm optimization with differential evolution for open vehicle routing problem. WCICA, pp 2692–2697Google Scholar
  17. 17.
    Mirhassani SA, Abolghasemi N (2011) A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst Appl 38:11547–11551CrossRefGoogle Scholar
  18. 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–122Google Scholar
  19. 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–233Google Scholar
  20. 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–790Google Scholar
  21. 21.
    Voudouris C, Tsang E (1995) Function optimization using guided local search. Technical Report CSM-249, University of Essex, ColchesterGoogle Scholar
  22. 22.
    Webster B (2004) Solving combinatorial optimization problems using a new algorithm based on gravitational attraction. MelbourneGoogle Scholar
  23. 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–18Google Scholar
  24. 24.
    Balachandar SR, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. Int J Comput Math Sci 4:223–228Google Scholar
  25. 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–11Google Scholar
  26. 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–474MathSciNetCrossRefzbMATHGoogle Scholar
  27. 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–81Google Scholar
  28. 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–11MathSciNetGoogle Scholar
  29. 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–752Google Scholar
  30. 30.
    Dueck G (1990) New optimization heuristics : the great deluge algorithm and the record-to-record travel. J Comput Phys 90:161–175MathSciNetCrossRefGoogle Scholar
  31. 31.
    Li F, Golden B, Wasil E (2005) Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32:1165–1179CrossRefzbMATHGoogle Scholar
  32. 32.
  33. 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, 31979Google Scholar
  34. 34.
    Fisher M (1994) Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, pp 626-642Google Scholar
  35. 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–6Google Scholar
  36. 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–455MathSciNetCrossRefzbMATHGoogle Scholar
  37. 37.
    Zachariadis EE, Kiranoudis ChT (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput Oper Res 37:712–723CrossRefzbMATHGoogle Scholar
  38. 38.
    Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol Comput 15:80–94CrossRefzbMATHGoogle Scholar
  39. 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–895Google Scholar

Copyright information

© The Natural Computing Applications Forum 2016

Authors and Affiliations

  • Ali Asghar Rahmani Hosseinabadi
    • 1
  • Javad Vahidi
    • 2
  • Valentina Emilia Balas
    • 3
  • Seyed Saeid Mirkamali
    • 4
  1. 1.Young Researchers and Elite Club, Ayatollah Amoli BranchIslamic Azad UniversityAmolIran
  2. 2.Iran University of Science and TechnologyTehranIran
  3. 3.Aurel Vlaicu UniversityAradRomania
  4. 4.Department of Computer Engineering and IT, Faculty of Computer SciencePayame Noor UniversityTehranIran

Personalised recommendations