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.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:113674 |
| Date | January 2011 |
| Creators | Kobzareva, Maria |
| Contributors | Fábry, Jan, Pelikán, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds