Journal of Engineering and Applied Sciences

Year: 2019
Volume: 14
Issue: 9
Page No. 2993 - 2998

Algorithms Heuristic for Solving the of Open Vehicle Routing Problem

Authors : Byron Campo Zuniga, Adel Mendoza Mendoza and Daniel Mendoza Casseres

References

Braekers, K., K. Ramaekers and I. Van Nieuwenhuyse, 2016. The vehicle routing problem: State of the art classification and review. Comput. Ind. Eng., 99: 300-313.
CrossRef  |  Direct Link  |  

Brandao, J., 2004. A tabu search algorithm for the open vehicle routing problem. Eur. J. Oper. Res., 157: 552-564.
CrossRef  |  Direct Link  |  

Brito, J., F.J. Martinez, J.A. Moreno and J.L. Verdegay, 2015. An ACO hybrid metaheuristic for close-open vehicle routing problems with time windows and fuzzy constraints. Appl. Soft Comput., 32: 154-163.
CrossRef  |  Direct Link  |  

Christofides, N., 1979. Combinatorial Optimization. John Wiley & Sons Canada Ltd, London, Canada, ISBN:9780471997498, Pages: 425.

Christofides, N., A. Mingozzi and P. Toth, 1981. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programm., 20: 255-282.
CrossRef  |  Direct Link  |  

Dijkstra, E.W., 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269-271.
CrossRef  |  Direct Link  |  

Eppen, G.D., 2000. [Investigation of Operations in Administrative Science: Construction of Models for Decision Making with Electronic Spreadsheets]. Pearson Educacion, London, England, ISBN:9789701702703, Pages: 792 (In Spanish).

Fisher, M.L., 1994. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res., 42: 626-642.
CrossRef  |  Direct Link  |  

Fu, Z., R. Eglese and L.Y. Li, 2005. A new Tabu Search Heuristic for the open vehicle routing problem. J. Oper. Res. Soc., 56: 267-274.
CrossRef  |  Direct Link  |  

Hosseinabadi, A.A.R., J. Vahidi, V.E. Balas and S.S. Mirkamali, 2018. OVRP-GELS: Solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput. Appl., 29: 955-968.
CrossRef  |  Direct Link  |  

Jarnik, V., 1930. [About a certain minimal problem (From the Letter of Mr. O. Boruvkov) (In Spanish)]. Work Moravian Nat. Sci. Soc., 6: 57-63.
Direct Link  |  

Ngueveu, S.U., C. Prins and R.W. Calvo, 2010. An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res., 37: 1877-1885.
CrossRef  |  Direct Link  |  

Prim, R.C., 1957. Shortest connection networks and some generalizations. Bell. Syst. Technol. J., 36: 1389-1401.
Direct Link  |  

Sariklis, D. and S. Powell, 2000. A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc., 51: 564-573.
CrossRef  |  Direct Link  |  

Tyasnurita, R., E. Ozcan and R. John, 2017. Learning heuristic selection using a time delay neural network for open vehicle routing. Proceedings of the 2017 IEEE International Congress on Evolutionary Computation (CEC), June 5-8, 2017, IEEE, San Sebastian, Spain, ISBN:978-1-5090-4602-7, pp: 1474-1481.

Yousefikhoshbakht, M., F. Didehvar and F. Rahmati, 2014. Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm. Int. J. Prod. Res., 52: 2565-2575.
CrossRef  |  Direct Link  |  

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved