Operations Management
10. Tutorial: Operation Scheduling – Exercises
Exercise 1: Route Planning
To offer an optimal service to all customers, RoboTec Inc. operates several branches in
Germany. These branches are supplied regularly with spare parts. At the moment, RoboTec
Inc. owns only one supply truck. The following figure shows the central warehouse as well as
the branches.
Central Warehouse
Branch
Hamburg (2)
Berlin (4)
Münster (0)
Dresden (5)
Kassel (1)
Stuttgart (3)
With help of the controlling department, a cost unit rate for the driven kilometers of the
support vehicle could be determined. The (symmetric) costs of the respective subsections are
as follows (costs in €).
From / To Münster (0) Kassel (1) Hamburg (2) Stuttgart (3) Berlin (4) Dresden (5)
Münster (0) - 207 281 473 472 553
Kassel (1) 207 - 308 367 379 351
Hamburg (2) 281 308 - 667 289 477
Stuttgart (3) 473 367 667 - 637 510
Berlin (4) 472 379 289 637 - 194
Dresden (5) 553 351 477 510 194 -
, a) Please determine an optimal route for the support vehicle by use of the pairwise
permutation. The initial route goes from Münster via Kassel, Hamburg, Stuttgart, Berlin and
Dresden back to Münster. Calculate the total costs of the initial route as well as of your new
determined route.
1. Iteration:
From \ To 01 12 23 34 45 50
01
12
23
34
45
50
2
10. Tutorial: Operation Scheduling – Exercises
Exercise 1: Route Planning
To offer an optimal service to all customers, RoboTec Inc. operates several branches in
Germany. These branches are supplied regularly with spare parts. At the moment, RoboTec
Inc. owns only one supply truck. The following figure shows the central warehouse as well as
the branches.
Central Warehouse
Branch
Hamburg (2)
Berlin (4)
Münster (0)
Dresden (5)
Kassel (1)
Stuttgart (3)
With help of the controlling department, a cost unit rate for the driven kilometers of the
support vehicle could be determined. The (symmetric) costs of the respective subsections are
as follows (costs in €).
From / To Münster (0) Kassel (1) Hamburg (2) Stuttgart (3) Berlin (4) Dresden (5)
Münster (0) - 207 281 473 472 553
Kassel (1) 207 - 308 367 379 351
Hamburg (2) 281 308 - 667 289 477
Stuttgart (3) 473 367 667 - 637 510
Berlin (4) 472 379 289 637 - 194
Dresden (5) 553 351 477 510 194 -
, a) Please determine an optimal route for the support vehicle by use of the pairwise
permutation. The initial route goes from Münster via Kassel, Hamburg, Stuttgart, Berlin and
Dresden back to Münster. Calculate the total costs of the initial route as well as of your new
determined route.
1. Iteration:
From \ To 01 12 23 34 45 50
01
12
23
34
45
50
2
