Return to search

Plánování dovolené v Evropě s využitím cílového programování / Planning a holidays in Europe with using goal programming

In this thesis I consider possibility to spend my vacation in one of the three countries: Spain, France, Italy. In each country I chose ten cities, which I would like to visit. I will use Travel Salesman Problem to decide the best route inside each country according to three criteria: Cost, Minutes and Transport. There is also a possibility to choose the type of transport: train or combination of train and airplane. Also I will use Weighted goal programming and Chebyshev goal programming to optimize all criteria simultaneously. In the end I will use multiple -- criteria decision analysis to compare results. According to three methods (ORESTE, ELECTRE III, TOPSIS) I will choose one of the states for my vacation. I will make all calculation in program MPL and in Excel using solver SANNA.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:194546
Date January 2014
CreatorsOtarbayeva, Zhamilya
ContributorsSkočdopolová, Veronika, Kuncová, Martina
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