Zur Seitenansicht
 

Titelaufnahme

Titel
The Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / eingereicht von Arevik Hakobian
VerfasserHakobian, Arevik
Begutachter / BegutachterinDörner, Karl F.
ErschienenLinz, 2017
Umfangxv, 103 Seiten : Illustrationen
HochschulschriftUniversität Linz, Diplomarbeit, 2017
SpracheEnglisch
DokumenttypDiplomarbeit
Schlagwörter (DE)Tabu Suche / Tourenplanung / weiche Zeitfenster / Optimierung / iterierte lokale Suche
Schlagwörter (EN)tabu search / vehicle routing problem / soft time windows / iterated local search
Schlagwörter (GND)Logistiksystem / Tourenplanung / Verbraucherzufriedenheit / Algorithmus
URNurn:nbn:at:at-ubl:1-14237 Persistent Identifier (URN)
Zugriffsbeschränkung
 Das Werk ist gemäß den "Hinweisen für BenützerInnen" verfügbar
Dateien
The Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows [0.86 mb]
Links
Nachweis
Klassifikation
Zusammenfassung (Englisch)

In this work metaheuristics are introduced for the solution of the vehicle routing problem with soft time windows. The tabu search algorithm is implemented in this context along with the iterated local search and tested on different parameter settings and methods. During the tests on tabu search, intensification, diversification and route minimization strategies are gradually developed and implemented. The tabu search algorithm is further tested on different types of soft time windows. Computational test results of benchmark problems are calculated and compared to results from literature. Results show that in comparison with other tabu search algorithms, the tabu search generated in this work could outperform several paper results.