National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Initialization for optimization of real world vehicle routing problem
Volf, Robin ; Klhůfek, Jan (referee) ; Sedlák, David (advisor)
The goal of this work is to optimize the initialization phase in solving the rich vehicle routing problem on a specific dataset which comes from a czech logistics company's data. This dataset has characteristics of VRPTW, VRPSPD and HFVRP. A modified cheapest insertion heuristic was chosen for the solution. Cost calculation consists of six partial costs which reflect individual constraints. Proposed heuristic is able to solve the instances in a matter of few seconds. Construction heuristic which generates valid solutions in short time enables more effective optimization in latter parts of solution.
The Optimization of Maintenance of Bus Stops
Svobodová, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The aim of my thesis is to find the shortest total route to export trash at the bus stops for several variants and also determine the suitability of approximate algorithms. The tasks are solved by insertion heuristic, closest neighbor heuristic and optimization. The optimal solution is gained by using the system LINGO and by using optimization solver CPLEX. In my thesis I first describe the problem of maintenance of bus stops. Following chapter is devoted to the role of routing problems, its classifications, problems to solve, possibilities of solution. The used methods are Traveling Salesman Problem with one or multiple vehicles available in a unique depot and Vehicle Routing Problem with one or multiple vehicles available in a unique depot or multiple depots. The last chapter describes and compare the results of the solution of insertion heuristic, closest neighbor heuristic and optimization for problem of replacement of bus schedules and of maintenance of bus stops.

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