Return to search

Heuristické metody řešení zobecněných rozvozních úloh / Heuristic Methods for Solving Generalized Vehicle Routing Problems

The goal of the diploma thesis is to introduce and describe a heuristic method for finding a sub-optimal system of circuits in a generalized vehicle routing problem with time windows and time-dependent unit costs. Proposed method was built up on Clarke and Wright's savings method for the standard vehicle routing problem. Additionally, there has been described an algorithm for improving current solution via finding an optimal time harmonogram for a journey on each circuit within the found sub-optimal system of circuits.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:198840
Date January 2010
CreatorsKalendovský, Jan
ContributorsFábry, Jan, Pelikán, Jan
PublisherVysoká škola ekonomická v Praze
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.002 seconds