Operational Pickup and Delivery Transportation with Incidents

1. Operational Pickup and Delivery Transportation with Incidents Jonne Zutt – j.zutt@tudelft.nl Algorithmics, Faculty of Electrical Engineering, Mathematics and Computer Science Delft University of Technology Netherlands

2. Contents • Problem description • Applications • Literature • Research questions • Approach and results • Future work

3. Pickup and delivery transport • Pickup and Delivery Transportation Problem: freight has to be transported from a source to a destination location respecting specified timeintervals on a transport network with limitedcapacities and speeds. • Limited capacities lead to conflicts. • Malfunctioning resources (infrastructure and transport resources). • Problem description • Applications • Literature • Research questions • Approach and results • Future work

4. Applications • AGV containerterminals • Taxiing of airplanes at an airport • Inlandshipping • Problem description • Applications • Literature • Research questions • Approach and results • Future work

5. Literature • Mixed Integer Programming (Savelsbergh and Sol, 1995) • Context-Aware Routing (Kim and Tanchoco, 1991) • Reduction to Job Shop Scheduling with blocking (Hatzack and Nebel, 2001) • Survey of techniques for scheduling with uncertainty (Davenport and Beck, 2000) • Problem description • Applications • Literature • Research questions • Approach and results • Future work

6. Research questions • What information is necessary to obtain efficient planning methods? • What happens when varying workload, number of agents (scalability), incident level (normal to extreme circumstances, robustness)? • What is the relation between performance and characteristics of the transport network? • Problem description • Applications • Literature • Research questions • Approach and results • Future work

7. Methods • Uninformed • Informed • Revising priorities • Revising routes • Collaboration • Problem description • Applications • Literature • Research questions • Approach and results • Future work

8. Future work • Finish experiments • Redundancy: slack-inserting heuristic • Multiple-objective routing (SAMCRA) • Collaboration • Mixing strategies • Finish the writing • Problem description • Applications • Literature • Research questions • Approach and results • Future work

9. The End

10. Traplas Communication RoutePlanner PlanningSystem OperationalPlanner OPAuction OPGenerator OPScheduling OPShortestPath OPLPAstar

11. Empirical results Revising priorities

12. Empirical results Revising routes

13. Empirical results Revising routes

14. Port of Rotterdam (ECT)

15. Hard instances for H&N

16. Transport network

17. Conflicts

18. Interface Traplas – TraplasViz • # LOC timestamp id name cap dist spd type w h x y rotLOCATION 0 1 R48 101 15.17 1 0 1.0 1508 652 78261 33584 0 • # ARC timestamp id name from to type directionARC 0 3 EXIT_27_2-EXIT_09 1 6128 0 1 • BEGIN 0 1190107322 • SETTIMESCALE 0 1 • TRNEW 0 0 TR(0) 3 1.0 1299 1 • NEWCARG 0 79 O7 4 1.0 4423 • DRV 0 55 5809 9296 2355 0 5.04453 • CLAIM 5.04453 55 9296 • PI 5.04453 DELAY 5.04453 0 • UNLOAD 2552.48 132 7008 1036 2552.48 2562.48 • RMCARG 2552.48 1036 • TRDEL 2552.48 0 • SYNC_TIMER 2552.48 3000