Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Design of an Adaptive Support Vector Regressor Controller for a Spherical Tank System Read chapter Read first chapter

2015 | OriginalPaper | Chapter

Oscillated Variable Neighborhood Search for Open Vehicle Routing Problem

Authors : Bekir Güler, Aişe Zülal Şevkli

Published in: Neural Information Processing

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter FANet: Factor Analysis Neural Network
next chapter Non-Line-of-Sight Mitigation via Lagrange Programming Neural Networks in TOA-Based Localization
Literature
1.
Leeuwen, J.V.: Algorithms and complexity. Elsevier [u.a.] (1998)
2.
Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5), 564–573 (2000)CrossRefMATH
3.
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)MathSciNetCrossRefMATH
4.
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)CrossRefMATH
5.
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)CrossRefMATH
6.
7.
8.
Zachariadis, E.E., Kiranoudis, C.T.: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Comput. Oper. Res. 37, 712–723 (2010)CrossRefMATH
9.
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)CrossRefMATH
10.
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)CrossRefMATH
11.
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)
12.
Marinakis, Y., Marinaki, M.: A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol. Comput. 15, 80–94 (2014)CrossRefMATH
13.
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-5545CrossRef
14.
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-0548CrossRef
15.
Hansen, P., Mladenovic, N.: Variable neighborhood search: principals and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001). ISSN 0377-2217MathSciNetCrossRefMATH
16.
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
17.
18.
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
19.
20.
Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Northwestern University (1993)
21.
22.
Potvin, J.-Y., Rousseau, J.-M.: An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46, 1433–1446 (1995)CrossRefMATH
23.
Savelsbergh, M.: The vehicle routing problem with time windows: minimizing route duration. Informs J Comput 4, 146–154 (1992)CrossRefMATH
24.
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)CrossRefMATH
25.
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)MathSciNetCrossRefMATH
26.
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial optimization. Wiley (1979)
27.
Metadata
Title
Oscillated Variable Neighborhood Search for Open Vehicle Routing Problem
Authors
Bekir Güler
Aişe Zülal Şevkli
Copyright Year
2015
Book
Neural Information Processing

Print ISBN: 978-3-319-26554-4

Electronic ISBN: 978-3-319-26555-1

Copyright Year: 2015

DOI
https://doi.org/10.1007/978-3-319-26555-1_21

Premium Partner

    Image Credits