1 / 17

A Dynamic Messenger Problem

A Dynamic Messenger Problem. Jan Fábry University of Economics Prague fabry@vse.cz. Structure of presentation. Introduction Static Messenger Problem Messenger Problem with Time Windows Dynamic Messenger Problem Conclusion.

roberteclark
Télécharger la présentation

A Dynamic Messenger Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Dynamic Messenger Problem Jan Fábry University of Economics Prague fabry@vse.cz

  2. Structure of presentation • Introduction • Static Messenger Problem • Messenger Problem with Time Windows • Dynamic Messenger Problem • Conclusion _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 2

  3. 2 3 5 9 4 8 7 6 1. Introduction Messenger problem - example Depot 1 _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 3

  4. 2. Static Messenger Problem Requirements of ALL customers are known before a dispatcher starts to plan the route. _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 4

  5. i i i +1 i +1 2. Static Messenger Problem Model assumptions SOURCE (even nodes) DESTINATION (odd nodes) YES NO ! _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 5

  6. 2. Static Messenger Problem Traveling Salesman Problem minimize subject to _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 6

  7. 2 3 5 9 4 8 7 6 2. Static Messenger Problem Messenger problem - example Optimal route Depot 1 1 _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 7

  8. 3. Messenger Problem with TW minimize subject to {Time Window} _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 8

  9. 4. Dynamic Messenger Problem A new requirement for pick-up and delivery can occur during the travel. These two actions will be integrated into the current route. _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 9

  10. 4. Dynamic Messenger Problem Optimization Static problem Heuristic/metaheuristic A new requirement Re-optimization Dynamic problem Heuristic/metaheuristic _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 10

  11. 10 11 2 3 5 9 4 8 7 6 4. Dynamic Messenger Problem Insertion algorithm Optimal route Depot 1 1  _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 11

  12. 4. Dynamic Messenger Problem Insertion algorithm (1) (2) _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 12

  13. 4. Dynamic Messenger Problem Extension of the current route Insertion algorithm (1) (2) _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 13

  14. 4. Dynamic Messenger Problem Re-optimization minimize {Set of non-visited locations} {Increasing sequence of locations of packages that have not been picked up} subject to {Index of next location} _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 14

  15. 10 11 2 3 5 9 4 8 7 6 4. Dynamic Messenger Problem Re-optimization Optimal route Depot 1 1  _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 15

  16. 5. Conclusion • Heuristics & metaheuristics • Time windows • Multiple messengers - one depot- multiple depots • Capacity _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 16

  17. Thank you for attention ☺ _______________________________________________________________________________________ EURO XXII – European Conference on Operations Research, Prague 2007 17

More Related