Skip to main content

2018 | OriginalPaper | Buchkapitel

The Improved Saving Algorithm of VSP with Hybrid Time Windows Constraints

verfasst von : Yang Liu

Erschienen in: Proceedings of the Fifth International Forum on Decision Sciences

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Delivery is the link that is directly related to consumers in the logistics activity. The delivery cost accounts for a fairly high percentage among the various costs of logistics. Whether the vehicles’ routes are selected rationally or not takes great effect on the speed, cost and benefits in distribution, especially on the complicated distribution lines with multiple users. This paper proposes the improved saving algorithm of vehicle scheduling problem with hybrid time windows and designs the calculation process. The improved saving algorithm designed in this paper show great performance in terms of the solving effect especially for the VSP of small-scale, it has certain practical value.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

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!

Literatur
1.
Zurück zum Zitat Bodin L, Golden B, Assad A, Ball M (1998) Routing and scheduling of vehicles and crews: the state of art. Comput Oper Res 10(1):22–19 Bodin L, Golden B, Assad A, Ball M (1998) Routing and scheduling of vehicles and crews: the state of art. Comput Oper Res 10(1):22–19
2.
Zurück zum Zitat Bramel J, Simchi-levi D (2010) A location based heuristics for general routing problems. Oper Res 43:649–660CrossRef Bramel J, Simchi-levi D (2010) A location based heuristics for general routing problems. Oper Res 43:649–660CrossRef
3.
Zurück zum Zitat Gendreau M, Hertz A, Laporte G, Stan M (1999) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper Res 43(3):330–335CrossRef Gendreau M, Hertz A, Laporte G, Stan M (1999) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper Res 43(3):330–335CrossRef
4.
Zurück zum Zitat Malmborg C (2006) Genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93(1):121–134CrossRef Malmborg C (2006) Genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93(1):121–134CrossRef
5.
Zurück zum Zitat Oliver I, Smith D, Holland JR (1987) A study of permutation crossover operators on the traveling salesman problem. In: Genetic algorithms and their application: proceeding of second international conference on genetic algorithms, pp 224–230 Oliver I, Smith D, Holland JR (1987) A study of permutation crossover operators on the traveling salesman problem. In: Genetic algorithms and their application: proceeding of second international conference on genetic algorithms, pp 224–230
6.
Zurück zum Zitat Osman IH (2003) Metastrategy simulated annealing and Tabu Search Algorithms for the vehicle routing problem. Ann Oper Res 41:421–451CrossRef Osman IH (2003) Metastrategy simulated annealing and Tabu Search Algorithms for the vehicle routing problem. Ann Oper Res 41:421–451CrossRef
7.
Zurück zum Zitat Solomon MM (2010) Vehicle routing and scheduling with time windows constraints: models and algorithms, vol 10(1). Ph. D. dissertation, Department of Decision Sciences, pp 2–7 Solomon MM (2010) Vehicle routing and scheduling with time windows constraints: models and algorithms, vol 10(1). Ph. D. dissertation, Department of Decision Sciences, pp 2–7
8.
Zurück zum Zitat Torki A, Somhon S, Enkawa T (2012) Competitive neural network algorithm for solving vehicle routing problem. Comput Ind Eng 33(3–4):473-476CrossRef Torki A, Somhon S, Enkawa T (2012) Competitive neural network algorithm for solving vehicle routing problem. Comput Ind Eng 33(3–4):473-476CrossRef
Metadaten
Titel
The Improved Saving Algorithm of VSP with Hybrid Time Windows Constraints
verfasst von
Yang Liu
Copyright-Jahr
2018
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-7817-0_14

Premium Partner