Plowing the Streets of Pittsburgh A Dynamic Route Planning System J. - PowerPoint PPT Presentation

Plowing the Streets of Pittsburgh A Dynamic Route Planning System J. Kinable 1 , 2 W-J. van Hoeve 2 . Smith 1 S.F 1 Robotics Institute - Carnegie Mellon University, USA 2 Tepper School of Business - Carnegie Mellon University, USA January 19, 2016 J. Kinable (Carnegie Mellon University) January 19, 2016 1 / 33

Motivation & Goals "Drivers have printed routing directions laying on the passenger seat. Most of them know the route (or an interpretation thereof) by heart." "A lot of time is lost due to emergency plow requests." "People complain that primary roads in their district are full of snow, while in other districts tertiary roads have already been serviced." J. Kinable (Carnegie Mellon University) January 19, 2016 3 / 33

Motivation (2) Consumable resource costs: 4,3M$ (2014/2015), 3.3M$ 1 (2013/2014) Labor costs: 3.3M$ (2014/2015) 2 Equipment costs: 800K$ (2014/2015) 3 Snow and ice control staff: 275 4 safety economy environment Generalizes to street sweeping, street maintenance, garbage collection, etc. J. Kinable (Carnegie Mellon University) January 19, 2016 4 / 33

Goal Design a route planning system that issues optimized turn-by-turn instructions to the vehicles as they execute routes, and dynamically revises these plans as unexpected events force changes. J. Kinable (Carnegie Mellon University) January 19, 2016 5 / 33

Problem Description - Routes Road segments: start/end # lanes priority class shape driving speed directionality J. Kinable (Carnegie Mellon University) January 19, 2016 6 / 33

Problem Description - Vehicles Vehicles: Location Salt Capacity Fuel Capacity Salt economy Fuel economy J. Kinable (Carnegie Mellon University) January 19, 2016 7 / 33

Problem Description - Depots Depots: Location Salt (y/n) Fuel (y/n) J. Kinable (Carnegie Mellon University) January 19, 2016 8 / 33

Related models Chinese postman problem Vehicle routing with resource constraints Resource-constrained project scheduling with renewable and non-renewable resources For overview of Snow plowing literature, see N. Perrier, A. Langevin, et. al: [1, 2, 3, 4] Synchronized arc routing for snow plowing operations [5] City of Dieppe: 24,000 inhabitants, 462 intersections, 1,234 road segments ( ≤ 20 % Downtown Pittsburgh) J. Kinable (Carnegie Mellon University) January 19, 2016 9 / 33

Model - Objective Objectives: Makespan 1 Minimize deadheading 2 Weighted objective of Completion times per priority class 3 J. Kinable (Carnegie Mellon University) January 19, 2016 10 / 33

Model - Constraints Constraints: Vehicles start/end at depot 1 Every lane on a street segment must be covered, subject to traffic 2 direction. Renewable resource constraints: fuel, salt 3 Time constraints 4 J. Kinable (Carnegie Mellon University) January 19, 2016 11 / 33

Model Job: Job types: ID source depot job 1 1 start location target depot job 2 2 end location plow job 3 3 duration refuel job 4 4 fuel & salt requirement resupply salt job 5 5 J. Kinable (Carnegie Mellon University) January 19, 2016 12 / 33

Mathematical models Mixed Integer Programming Constraint Programming J. Kinable (Carnegie Mellon University) January 19, 2016 13 / 33

Mixed Integer Programming Model - Outline Variables: ◮ Three-index formulation: Vehicle k performs job j after job i . ◮ Variables recording resource utilization: time, salt, fuel Constraints: ◮ All plow jobs have to be performed, refuel/resupply jobs are optional ◮ Decide on direction for bidirectional jobs ◮ Resource constraints for fuel/salt/time J. Kinable (Carnegie Mellon University) January 19, 2016 14 / 33

Constraint Programming Model - Outline Variables: ◮ Job (interval) variables. ◮ Job to vehicle assignment variables Constraints (outline): ◮ Job sequencing constraints for each vehicle ◮ Alternative constraint for job to vehicle assignment ◮ Cumulative functions to manage resources J. Kinable (Carnegie Mellon University) January 19, 2016 15 / 33

Heuristic Constructive Heuristic Late Acceptance improvement heuristic J. Kinable (Carnegie Mellon University) January 19, 2016 16 / 33

Constructive Heuristic - Phase 1 Order jobs based on their priority 1 Constructively build schedules - Insert jobs 1 by 1 2 ? J. Kinable (Carnegie Mellon University) January 19, 2016 17 / 33

Constructive Heuristic - Phase 2 Insert Refuel and Resupply salt jobs 1 Fuel Time ? ? J. Kinable (Carnegie Mellon University) January 19, 2016 18 / 33

Late acceptance improvement heuristic Quality (lower is better) Compare with solution L Candidate solution iterations ago Solution L iterations ago Iteration J. Kinable (Carnegie Mellon University) January 19, 2016 19 / 33

Late acceptance heuristic Moves: Swap 1 Remove/insert 2 Termination: Time limit 1 Max number of non-improvements 2 J. Kinable (Carnegie Mellon University) January 19, 2016 20 / 33

Experiments - Setup Take 2 snapshots from OSM 1 Extract graph, pre-process and ensure Strong Connectivity 2 Execute routing algorithm 3 J. Kinable (Carnegie Mellon University) January 19, 2016 21 / 33

Routing and Plowing Graph J. Kinable (Carnegie Mellon University) January 19, 2016 22 / 33

Experiments (4/22 instances) Kamin St: mt Washington: 28 intersections 406 intersections 1 1 45 plow jobs 577 plow jobs 2 2 plowing: 4mi plowing: 52mi 3 3 bidirectional: 38% bidirectional: 81% 4 4 Residential: Downtown: 2441 intersections 345 intersections 1 1 4073 plow jobs 724 plow jobs 2 2 plowing: 316mi plowing: 38mi 3 3 bidirectional: 64% bidirectional: 38% 4 4 J. Kinable (Carnegie Mellon University) January 19, 2016 23 / 33

Experiments J. Kinable (Carnegie Mellon University) January 19, 2016 24 / 33

Experiments - Kamin 1 0 . 8 Coverage(%) 0 . 6 0 . 4 LA range 0 . 2 LA average Constructive Heuristic CP 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 : : : : : : : : : 0 2 4 6 8 0 2 4 6 0 0 0 0 0 1 1 1 1 : : : : : : : : : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Time J. Kinable (Carnegie Mellon University) January 19, 2016 25 / 33

Experiments - Downtown 1 0 . 8 Coverage(%) 0 . 6 0 . 4 LA range 0 . 2 LA average Constructive Heuristic CP 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 : : : : : : : : : : 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 5 0 1 2 3 : : : : : : : : : : 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 Time J. Kinable (Carnegie Mellon University) January 19, 2016 26 / 33

Experiments - Mnt Washington 1 0 . 8 Coverage(%) 0 . 6 0 . 4 LA range 0 . 2 LA average Constructive Heuristic CP 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 : : : : : : : : : : : : : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 5 0 1 2 3 4 5 0 : : : : : : : : : : : : : 0 0 0 0 0 0 1 1 1 1 1 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 Time J. Kinable (Carnegie Mellon University) January 19, 2016 27 / 33

Experiments - Residential 1 0 . 8 Coverage(%) 0 . 6 0 . 4 0 . 2 LA range LA average Constructive Heuristic 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 : : : : : : : : : : : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 : : : : : : : : : : : 0 1 2 3 4 5 6 7 8 9 0 0 0 0 0 0 0 0 0 0 0 1 Time J. Kinable (Carnegie Mellon University) January 19, 2016 28 / 33

Experiments - Residential Pittsburgh solution Schedule completion time: 07:38:33 Pittsburgh Residential - Makespan (runtime 2h) Pittsburgh Residential - Makespan (runtime 2h) 05:30:00 50 Plowing Refuels 45 Deadheading Resupply salt 05:00:00 U-turns 40 04:30:00 35 04:00:00 30 Time Value 03:30:00 25 20 03:00:00 15 02:30:00 10 02:00:00 5 01:30:00 0 1 2 3 4 5 1 2 3 4 5 Vehicle Vehicle J. Kinable (Carnegie Mellon University) January 19, 2016 29 / 33

Summary of preliminary results MIP not suitable: bounds are too weak CP works well for small instances Constructive heuristic finds reasonable solutions in ms. LA heuristic produces solutions of consistent quality Idea: Improve LA solutions with a CP-Large Neighborhood Search J. Kinable (Carnegie Mellon University) January 19, 2016 30 / 33

Future requirements Road priorities 1 U-turns 2 Vehicle weight/width restrictions on roads 3 Efficient construction/updating of distance matrix 4 Adaptive system 5 J. Kinable (Carnegie Mellon University) January 19, 2016 31 / 33

Bibliography I [1] N. Perrier, A. Langevin, and J. F . Campbell, “A survey of models and algorithms for winter road maintenance. part i: system design for spreading and plowing.” Computers & Operations Research , vol. 33, pp. 209–238, 2006. [2] ——, “A survey of models and algorithms for winter road maintenance. part ii: system design for snow disposal,” Computers & Operations Research , vol. 33, no. 1, pp. 239 – 262, 2006. [3] ——, “A survey of models and algorithms for winter road maintenance. part iii: Vehicle routing and depot location for spreading,” Computers & Operations Research , vol. 34, no. 1, pp. 211 – 257, 2007. J. Kinable (Carnegie Mellon University) January 19, 2016 32 / 33