Abstract
Open Vehicle routing problems is a variant of Vehicle Routing Problem, in which vehicles don’t return the depot after serving the customers. In this study, we proposed a cluster first-routed second based algorithm. We combined Kmeans and Variable Neighborhood Search in this algorithm. Our proposed algorithm achieves the best know solutions within a reasonable time for all well-known small and medium scale benchmarks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Leeuwen, J.V.: Algorithms and complexity. Elsevier [u.a.] (1998)
Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5), 564–573 (2000)
Tarantilis, C.D., Ioannou, G., Kiranoudis, C.T., Prastacos, G.P.: A threshold accepting aproach to the open vehicle routing problem, RAIRO. Oper. Res. 38, 345–360 (2004)
Tarantilis, C.D., Ioannou, G., Kiranoudis, C.T., Prastacos, G.P.: Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. J. Oper. Res. Soc. 56(5), 588–596 (2005)
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)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)
Brandão, J.: A tabu search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 157(3), 552–564 (2004)
Zachariadis, E.E., Kiranoudis, C.T.: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput. Oper. Res. 37, 712–723 (2010)
Aksen, D., Özyurt, Z., Aras, N.: Open vehicle routing problem with driver nodes and time deadlines. J. Oper. Res. Soc. 58(9), 1223–1234 (2007)
Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195(3), 803–809 (2009)
Kritzinger, S., Doerner, K.F., Tricoire, F., Hartl, R.F.: Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison. Yugoslav J. Oper. Res. (2014)
Marinakis, Y., Marinaki, M.: A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol. Comput. 15, 80–94 (2014)
Fung, R.Y.K., Liu, R., Jiang, Z.B.: A memetic algorithm for the open capacitated arc routing problem. Transp. Res. Part E Log. Transp. Rev. 50, 53–67 (2013). ISSN 1366-5545
Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013). ISSN 0305-0548
Hansen, P., Mladenovic, N.: Variable neighborhood search: principals and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001). ISSN 0377-2217
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics, pp. 281–297. University of California Press, Berkeley (1967). http://projecteuclid.org/euclid.bsmsp/1200512992
http://en.wikipedia.org/w/index.php?title=K-means_clustering&oldid=655354053. (Accessed 10 April 2015 08:02 UTC 2015)
Derbel, H., Jarboui, B., Chabchoub, H., Hanafi, S., Mladenovic, N.: A variable neighborhood search for the capacitated location-routing problem. In: 2011 4th International Conference on Logistics (LOGISTIQUA), pp. 514–519, 31 May 2011–3 June 2011
Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61–75 (1956)
Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Northwestern University (1993)
Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)
Potvin, J.-Y., Rousseau, J.-M.: An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46, 1433–1446 (1995)
Savelsbergh, M.: The vehicle routing problem with time windows: minimizing route duration. Informs J Comput 4, 146–154 (1992)
Taillard, E., Badeau, P., Gendreau, M., Guertin, F., J-Y, P.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci. 31, 170–186 (1997)
Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial optimization. Wiley (1979)
Fisher, M.: Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42, 626–642 (1994)
Acknowledgements
This work is supported by the Scientific Research Fund of Fatih University under the project number P50071503_B.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Güler, B., Şevkli, A.Z. (2015). Oscillated Variable Neighborhood Search for Open Vehicle Routing Problem. In: Arik, S., Huang, T., Lai, W., Liu, Q. (eds) Neural Information Processing. ICONIP 2015. Lecture Notes in Computer Science(), vol 9491. Springer, Cham. https://doi.org/10.1007/978-3-319-26555-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-26555-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26554-4
Online ISBN: 978-3-319-26555-1
eBook Packages: Computer ScienceComputer Science (R0)