National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Computer service ‒ an aplication of traveling salesman problem
Ryglová, Michaela ; Skočdopolová, Veronika (advisor) ; Dvořák, Marek (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This thesis deals with the solution of traveling salesman problem to minimize distance in kilometres and focus on customer requirements, I am using data from firm CTR s.r.o. In addition to the basic model are also used mathematical model with modification tasks, so it is a model with hard time windows and a model with soft time windows. A practical solution is used in an optimization modeling language in Lingo software. The optimum solution was found for the model the traveling salesman and its modifications. The longest route 40.2 kilometers provides modification with a soft time windows, but gives the most emphasis on customer requirements. The shortest route 24 km is found with using a model the traveling salesman problem, but not considered any customer requirements.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.