National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Heuristic methods for messenger problem
Kobzareva, Maria ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This work describes static and dynamic problems with one messenger or multiple number of messengers and suggests a possibility of solving such problems with modified heuristic methods. To solve messenger problem, modified nearest neighbor heuristic, modified insertion heuristic and modified exchange heuristic are used. The main contribution of this work are applications, developed in MS Excel, programmed with Visual Basic for Application, that can solve static and dynamic problems with one messenger or multiple number of messengers and that could be beneficial for companies that do business in messenger services.
An optimization of messenger services
Karbusická, Martina ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
Logistics industry has experienced a great development in recent years and messenger companies are becoming increasingly huge competitor to mail order companies specializing in express shipping. This work defines such terms as traveling salesman or messenger, compares the leading messenger companies in Prague and it is mainly dedicated to Messenger a.s. The main goal of this work is the answer the question whether it is possible to optimize the route of messenger via software and what methods to use for the solving. The VBA application in MS Excel was developed for these purposes. It uses the optimization software Lingo for solving.

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