1. Vehicle Routing & Scheduling: Developments & Applications in Urban Distribution Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering rgthom@unimelb.edu.au IIT Bombay 10 th April 2014

2. Outline Vehicle Routing and Scheduling Collaborative Freight Systems B2C Performance Based Standards Ongoing Research References

3. Vehicle Routing & Scheduling Vehicle Routing Problem with Time Windows (VRPTW) Decision variables –schedules (trucks to customers) –routes (customer visiting order) Objective function: min. operating costs –Travel costs (time & distance) –Penalties (time windows) Constraints –Vehicle capacities –Customer time windows

4. Time windows and penalties

6. Metaheuristics Simulated Annealing (SA) Tabu Search (TS) Genetic Algorithms (GA) have been successfully applied to VRPTW…

7. Tabu Search An intelligent problem solving technique based on flexible memory Neighbourhoods examined for new solutions some moves are tabu or forbidden Need to: –Define search history –Determine how to generate neighbourhood solutions

8. Definitions A neighbourhood –set of solutions formed from current solution using a simple operation Tabu list –set of moves that are not allowed to avoid repetition

9. General Procedure (i) determine initial solution, this become the current solution (ii) if stopping criteria is not satisfied, generate neighbourhood solutions from the current solution, else finish (iii) current solution is selected from non-tabu neighbourhood solutions found in (ii), goto (ii)

10. Neighbourhood Generation Techniques Adjacency Exchange –Adjacent links for a tour are exchanged Insert Exchange –Tour links are randomly exchanged (2 usually) Cross Exchange –Segments of tours (multiple customers) are exchanged

11. Vehicle 1 Vehicle 2Vehicle 1 Vehicle 2 Move Move Operation

12. Vehicle 1Vehicle 2Vehicle 1Vehicle 2 Exchange Exchange Operation

13. Rule Determination Tabu Restrictions –Ban moves previously made –Can be conditional upon improvement gained (aspiration criteria) Selection Criteria –Usually best neighbourhood solution is selected (even if no improvement gained)

14. Neigbourhood Example

15. Benefits of considering travel time variability in vehicle routing with time windows Risk and Urban Distribution 2 International Patients registered… Risk of delays modelled using stochastic programming & robust optimisation Formed the basis for City Logistics modelling and intelligent transport systems research programs

16. Collaborative Distribution Shared storage location(s) Networks restructured using advanced vehicle routing & scheduling systems Distribution to outlets by areas & priority Substantial savings in transport costs (20- 30%) Significant reduction in environmental & social costs

17. Product Swaps Distribute 500kg between each site Vehicle capacity = 2000kg Each site ≥ 1 vehicle Transhipment possible at each site Based on distributing electrical goods between retail shops in Melbourne Concept could be applied to multiple carriers, horizontal collaboration (Fischer et al, 1995)

18. 4 5 vehicles no transhipment

19. 4 4 vehicles pickups at store w/o vehicle

20. 4 vehicles with transhipment at stores

21. 44 4 vehicles with transhipment at common location

23. Collaborative Distribution in Melbourne

24. Independent Networks from suppliers

25. Collaborative Network Around 20% saving in distance travelled

26. B2C Food Items

28. Single Urban DC

29. Regional DC’s

30. VKT with 1 DC

31. VKT with regional DCs

32. E-commerce supermarket home delivery network

33. Extended length, 36 Mail Cages Rigid

34. Standard 12.5m, 3AR 23T vs High Productivity 4AR 14.85m 28T PBS Vehicle +37% productivity

35. Depot Transfer Operation Depot 1 (LF=95%) Depot 3 (LF=90%) Depot 2 (LF=90%) Depot 4 (LF=87 %)

36. Multi Drop Operation DepotCustomer 1Customer 2Customer 3Customer 4 Customer N

37. Domestic Postal Fleet Impacts Estimated Kilometre reduction 29% Average Load Productivity increase 37% Cost reduction -8% Rigid truck numbers -20% (over 7 years) in Urban areas Generated high interest and has attracted a government and Industry scholarships

38. Ongoing Research Exact solution procedures Pickup & Delivery with transfers Intermodal networks (road & rail) Flexible trailer combinations Combining VRS with simulation (agent based modelling) Incorporating travel time information (dynamic routes)

39. References Hassall, K. and R.G. Thompson, (2011). Estimating the Benefits of Performance Based Standards Vehicles, Transportation Research Record, No. 2224, Journal of the Transportation Research Board, Transportation Research Board of the National Academies, Washington, D.C., 94-101. Taniguchi, E. and R.G. Thompson (2003). Predicting the effects of city logistics schemes, Transport Reviews, Vol. 23, No. 4, 489-515. Taniguchi, E. and R.G. Thompson (2002). Modeling City Logistics, Transportation Research Record, No. 1790, Transportation Research Board, National Research Council, Washington DC, 45-51. Taniguchi, E., R.G. Thompson, T. Yamada and R. Van Duin, (2001). City Logistics – Network Modelling and Intelligent Transport Systems, Elsevier, Pergamon, Oxford, 260pp. Taniguchi, E., Thompson, R.G. Yamada, T. (2012) ‘Emerging techniques for enhancing the practical application of city logistics models’, Procedia - Social and Behavioral Sciences, vol. 39, pp. 3-18. Thompson, R.G. and R. van Duin (2002). Vehicle Routing and Scheduling, in Innovations in Freight Transport, (E. Taniguchi and R.G. Thompson, Eds.), 47-64, WIT Press, Southampton. Thompson, R.G. and Hassall, K.P. (2012), A collaborative urban distribution network, Procedia - Social and Behavioral Sciences, vol. 39, pp. 230-240. Thompson, R.G., E. Taniguchi and T. Yamada, (2011). Estimating Benefits of Considering Travel Time Variability in Urban Distribution, Transportation Research Record: Journal of the Transportation Research Board, Transportation Research Board of the National Academies, Washington, D.C., No. 2238, 86-96.

40. © Copyright The University of Melbourne 2011