Dynamic Traveling Salesman Problem

1. Dynamic Traveling Salesman Problem Jan Fábry University of Economics Prague _____________________________________________________________________________________ MME 2006, Pilsen 1

2. Standard TSP (Static) Dynamic TSP All customers are known before start of travel Some requirements arrive after start of travel _____________________________________________________________________________________ MME 2006, Pilsen 2

3. Static TSP minimize subject to (Miler-Tucker-Zemlin) _____________________________________________________________________________________ MME 2006, Pilsen 3

4. 2 4 5 1 6 3 Static TSP Optimal Route Example Depot _____________________________________________________________________________________ MME 2006, Pilsen 4

5. 2 4 5 7 1 6 3 Dynamic TSP New customer    Example Depot _____________________________________________________________________________________ MME 2006, Pilsen 5

6. Dynamic TSP Re-optimizationof the route Insertion algorithm A new customer _____________________________________________________________________________________ MME 2006, Pilsen 6

7. Dynamic TSP minimize Set of locations to be visited subject to Re-optimization of the route _____________________________________________________________________________________ MME 2006, Pilsen 7

8. 2 4 5 7 1 6 3 Dynamic TSP New customer  Example Depot _____________________________________________________________________________________ MME 2006, Pilsen 8

9. r ik+1 ik Dynamic TSP Sequence of locations to be visited Insertion algorithm _____________________________________________________________________________________ MME 2006, Pilsen 9

10. TSP with Time Windows minimize subject to _____________________________________________________________________________________ MME 2006, Pilsen 10

11. TSP with Time Windows Change of the model: minimize Waiting times included _____________________________________________________________________________________ MME 2006, Pilsen 11

12. Dynamic TSP with Time Windows A new customer Re-optimizationof the route Insertion algorithm _____________________________________________________________________________________ MME 2006, Pilsen 12

13. Dynamic TSP with Time Windows minimize subject to Re-optimization of the route (to be continued…) _____________________________________________________________________________________ MME 2006, Pilsen 13

14. Dynamic TSP with Time Windows Re-optimization of the route _____________________________________________________________________________________ MME 2006, Pilsen 14

15. Dynamic TSP with Time Windows Sequence of customers to be visited Insertion algorithm _____________________________________________________________________________________ MME 2006, Pilsen 15

16. Dynamic TSP with Time Windows Insertion algorithm _____________________________________________________________________________________ MME 2006, Pilsen 16

17. TSP with Time Windows Penalties „Soft“ windows „Hard“ windows minimize _____________________________________________________________________________________ MME 2006, Pilsen 17