|
|
Optimalization in allocation drivers at bus service
Sokol, Petr ; Bartušek, Bohumír (advisor) ; Štěpán, Josef (referee)
The thesis is focused on suggesting an algorithm for planning of optimal assignment drivers and vehicles to scheme of expeditions. When we make the assignment, we aspire to minimize the total transportation costs. By the same mail we push for well-balanced assignment, with respect to utilization of drivers and vehicles . The structure of the planning problem there is describing by making out of a wide linear model, whose parts are algebraic formulations of restrictions, which one must in traffic abide. In this model we can see binary and real variables that mean we draw up a model of mixed integer programming. We can say, that the integer programming is in general more complicated, then integer programming. We used optimization software named GAMS for solution this problem. The software uses Branch and Bound algorithm for the integer number problems. We draw up a program in GAMS, which is able to set an optimal pian for assignment drivers and vehicles to expeditions. A part of this work is couple of exemplary tasks, with their solution.
|
|
|
Optimalization in allocation drivers at bus service
Sokol, Petr ; Štěpán, Josef (referee) ; Bartušek, Bohumír (advisor)
The thesis is focused on suggesting an algorithm for planning of optimal assignment drivers and vehicles to scheme of expeditions. When we make the assignment, we aspire to minimize the total transportation costs. By the same mail we push for well-balanced assignment, with respect to utilization of drivers and vehicles . The structure of the planning problem there is describing by making out of a wide linear model, whose parts are algebraic formulations of restrictions, which one must in traffic abide. In this model we can see binary and real variables that mean we draw up a model of mixed integer programming. We can say, that the integer programming is in general more complicated, then integer programming. We used optimization software named GAMS for solution this problem. The software uses Branch and Bound algorithm for the integer number problems. We draw up a program in GAMS, which is able to set an optimal pian for assignment drivers and vehicles to expeditions. A part of this work is couple of exemplary tasks, with their solution.
|
guest ::
