Return to search

Aplikace heuristických metod na rozvozní úlohu s časovými okny / Application of Heuristic Methods for Vehicle Routing Problem with Time Windows

This thesis demonstrates practical using of vehicle routing problem with time windows (VRPTW) and its solution by heuristic method. There are described teoretical principles of integer models, mathematical definitions of VRP with one or more vehicles, VRPTW and some heuristics for VRP. The practical part is solution of VRP by heuristic nearest neighbor. Product distribution is planed according to the firm settings in Prague. I compare existing situation and computed solution that show benefits of using described methods in conclusion.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:4504
Date January 2008
CreatorsChytrá, Alena
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.0018 seconds