Rozvozní problém s interním a externím dopravcem

This diploma thesis deals with a problem from the field of combinatorial optimization called Vehicle Routing Problem with Private and Common Carriers (VRPPC). A complete undirected symmetric graph is given. The task is to satisfy demands in all nodes with minimal total costs. There are two possibilities of doing so. Either private fleet or common carrier can be used for the transport of the demanded goods. The private costs depend on the covered distance whereas the common costs are conditional only on the weight of demand. Several heuristic methods for solving this problem are proposed and tested on three experimental instances of different sizes (in terms of number of nodes). Emphasis is primarily put on comparison between the presented heuristic and the classical optimization approach, which can often lead to inferior results (especially in case of larger instances) because of the computational complexity of the given problem.