Abstract
Traditional Open Vehicle Routing Problem (OVRP) methods take account to definite responding to the all requests of customers whiles the main goal of proposed approach in OVRP is decreasing the vehicle numbers time and path traveled by vehicles. Therefore, in the present paper, a new optimization algorithm based on Gravity law and mass interactions is introduced to solve the problem. This algorithm being proposed based on random search concepts utilizes two of the four major parameters in physics including speed and Gravity and its researcher agents are a set of masses which are in connection with each other based on Newton’s Gravity and motion laws. The proposed approach is compared with various algorithms and results approve its high effectiveness in solving the above problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput. Oper. Res. 34(10), 2918–2930 (2007)
Shamshirband, S., Shojafar, M., Hosseinabadi, A.A.R., Abraham, A.: Ovrp\_ica: an imperialist-based optimization algorithm for the open vehicle routing problem. In: Hybrid Artificial Intelligent Systems, pp. 221–233. Springer (2015)
Huang, F., Liu, C.: A hybrid tabu search for open vehicle routing problem. In: 2010 International Conference On Computer and Communication Technologies in Agriculture Engineering (CCTAE), vol. 1, pp. 132–134. IEEE (2010)
Huang, F., Liu, C.: An improved tabu search for open vehicle routing problem. In: 2010 International Conference on Management and Service Science (MASS), pp. 1–4. IEEE (2010)
Hosseinabadi, A.A.R., Kardgar, M., Shojafar, M., Shamshirband, S., Abraham, A.: Gels-ga: hybrid metaheuristic algorithm for solving multiple travelling salesman problem. In: 2014 14th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 76–81, Nov 2014
Pooranian, Z., Harounabadi, A., Shojafar, M., Hedayat, N.: New hybrid algorithm for task scheduling in grid computing to decrease missed task. World Acad. Sci. Eng. Technol. 55, 924–928 (2011)
Pan, L., Fu, Z.: A clonal selection algorithm for open vehicle routing problem. In: Proceedings of the 3rd International Conference on Genetic and Evolutionary Computing (WGEC09), pp. 786–790 (2009)
Hu, F., Wu, F.: Diploid hybrid particle swarm optimization with differential evolution for open vehicle routing problem. In: 2010 8th World Congress on Intelligent Control and Automation (WCICA), p. 2692–2697. IEEE (2010)
MirHassani, S.A., Abolghasemi, N.: A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38(9), 11547–11551 (2011)
Chen, P., Qu, Y., Huang, H., Dong, X.: A new hybrid iteratedlocal search for the open vehicle routing problem. In: Pacific-Asia Workshop on Computational Intelligenceand Industrial Application, 2008. PACIIA’08, vol. 1, pp. 891–895. IEEE (2008)
Rababah, A.: High accuracy hermite approximation for space curves in rd. J. Math. Anal. Appl. 325(2), 920–931 (2007)
Rababah, A.: Distances with rational triangular bézier surfaces. Appl. Math. Comput. 160(2), 379–386 (2005)
Shojafar, M., Abolfazli, S., Mostafaei, H., Singhal, M.: Improving channel assignment in multi-radio wireless mesh networks with learning automata. Wirel. Pers. Commun. 82(1), 61–80 (2015)
Chen, A-l, Yang, G-k, Zhi-ming, W.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ. Sci. A 7(4), 607–614 (2006)
Toth, P., Vigo, D.: The vehicle routing problem. Soc. Ind. Appl. Math. (2001)
Fisher, M.L.: Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4), 626–642 (1994)
Repoussis, P.P., Tarantilis, C.D., Bräysy, O., Ioannou, G.: A hybrid evolution strategy for the open vehicle routing problem. Comput. Oper. Res. 37(3), 443–455 (2010)
Zachariadis, E.E., Kiranoudis, C.T.: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput. Oper. Res. 37(4), 712–723 (2010)
Marinakis, Y., Marinaki, M.: A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol. Comput. 15, 80–94 (2014)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hosseinabadi, A.A.R., Kardgar, M., Shojafar, M., Shamshirband, S., Abraham, A. (2016). Gravitational Search Algorithm to Solve Open Vehicle Routing Problem. In: Snášel, V., Abraham, A., Krömer, P., Pant, M., Muda, A. (eds) Innovations in Bio-Inspired Computing and Applications. Advances in Intelligent Systems and Computing, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-319-28031-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-28031-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28030-1
Online ISBN: 978-3-319-28031-8
eBook Packages: EngineeringEngineering (R0)