Vehicle Routing & Scheduling: Developments & Applications in Urban Distribution Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering.

Slides:



Advertisements
Similar presentations
Introduction to Transportation Systems. PART II: FREIGHT TRANSPORTATION.
Advertisements

CITY LOGISTICS “Is the process of totally optimising the logistics and transport activities by private companies in urban areas while considering the traffic.
A tabu search heuristic to solve the split delivery Vehicle Routing Problem with Production and Demand Calendars (VRPPDC) Marie-Claude Bolduc Gilbert Laporte,
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows D. Popović, M. Vidović, M. Nikolić DEPARTMENT OF LOGISTICS.
Dr Russell G. Thompson Department of Civil and Environmental Engineering Urban Freight Transport, Logistics and ITS.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
Urban Freight Networks and Fleet Optimization Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering Assoc. Prof.
INNER URBAN FREIGHT TRANSPORT AND CITY LOGISTICS Transparencies 2003 EU-funded Urban Transport Research Project Results TRANSPORT TEACHING.
The SMARTFREIGHT project Hans Westerheim SINTEF ICT.
1 Dickson K.W. Chiu PhD, SMIEEE Text: Ballou - Business Logistics Management, 5/E (Chapter 6,7)Business Logistics Management, 5/E Transportation.
1.224J Recitation #4 Freight transportation. Topics Homework questions Home Depot MVRP: Multi vehicle routing problem – Applications – Formulation – Heuristics.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
CAPS RoutePro Routing Environment. Solution Methods. Backhauls. Dispatcher Interface. Demonstration.
Vehicle Routing & Scheduling
EAs for Combinatorial Optimization Problems BLG 602E.
Decision Support Systems for Supply Chain Management Chap 10 王仁宏 助理教授 國立中正大學企業管理學系 ©Copyright 2001 製商整合科技中心.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
A hybrid heuristic for an inventory routing problem C.Archetti, L.Bertazzi, M.G. Speranza University of Brescia, Italy A.Hertz Ecole Polytechnique and.
Coping with Variability in Dynamic Routing Problems Tom Van Woensel (TU/e) Christophe Lecluyse (UA), Herbert Peremans (UA), Laoucine Kerbache (HEC) and.
Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.
ESTIMATING THE EFFECTS OF ACCESS TIME WINDOWS IN THE MANAGEMENT OF URBAN DELIVERY FLEETS Jesús Muñuzuri University of Seville Spain.
Supply Chain Management COSC643 E-Commerce Supply Chain Management Sungchul Hong.
CAPS RoutePro CAPS Logistics Overview RoutePro Dispatcher Features.
Tabu Search Manuel Laguna. Outline Background Short Term Memory Long Term Memory Related Tabu Search Methods.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Evaluating City Logistics Schemes and Urban Freight Networks Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering
Planning and Modelling Urban Consolidation Centres
LOGO AAIA’2012 \ WCO’ – 12 september, 2012 S. Deleplanque, A. Quilliot. LIMOS, CNRS, BLAISE PASCAL UNIVERSITY, Clermont-Ferrand (FRANCE) Wrocław,
Transport Decisions Chapter 7
Vehicle routing using remote asset monitoring: a case study with Oxfam Fraser McLeod, Tom Cherrett (Transport) Güneş Erdoğan, Tolga Bektas (Management)
Routing and Scheduling in Transportation. Vehicle Routing Problem Determining the best routes or schedules for pickup/delivery of passengers or goods.
Edward Kent Jason Atkin Rong Qi 1. Contents Vehicle Routing Problem VRP in Forestry Commissioning Loading Bay Constraints Ant Colony Optimisation Handing.
F.Arshad, A. El Rhalibi and G. Kelleher
Systems Engineering for the Transportation Critical Infrastructure The Development of a Methodology and Mathematical Model for Assessing the Impacts of.
Swarm Intelligence 虞台文.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma.
G5BAIM Artificial Intelligence Methods
Single-solution based metaheuristics. Outline Local Search Simulated annealing Tabu search …
Transportation Logistics Professor Goodchild Spring 2011.
Materials Management Systems
11DSCI4743 Physical Distribution Definition Physical distribution is the movement & storage of finished goods from the end of production to the customer.
ANALYSIS TOOL TO PROCESS PASSIVELY- COLLECTED GPS DATA FOR COMMERCIAL VEHICLE DEMAND MODELLING APPLICATIONS Bryce Sharman & Matthew Roorda University of.
A Tour-Based Urban Freight Transportation Model Based on Entropy Maximization Qian Wang, Assistant Professor Department of Civil, Structural and Environmental.
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
© 2010 IBM Corporation IBM Container Transport Optimization Dr. Juergen Koehl, IBM Research and Development, Boeblingen Juergen Koehl, IBM Container Logistics.
The Transportation Logistics Company Indiana Logistics Summit Infrastructure Needs and Opportunities September 26, 2007.
Transportation II Lecture 16 ESD.260 Fall 2003 Caplice.
Applications of Tabu Search OPIM 950 Gary Chen 9/29/03.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
An idea for the future of logistics...
Decision Support Systems for Supply Chain Management
Ant Colony Optimisation: Applications
Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.
April 27, 2016 You need paper & pencil NO Test on Friday! 
Good vs Evil Distribution Math  You need paper & pencil
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
TransCAD Vehicle Routing 2018/11/29.
Transport Decisions Chapter 7
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Mahindra Logiquest 2018 – NMIMS
Subset of Slides from Lei Li, HongRui Liu, Roberto Lu
LOGISTICS AND TRANSPORTATION INDUSTRY
Generating and Solving Very Large-Scale Vehicle Routing Problems
Sustainability Impacts of Changing Retail Behavior
Physical Distribution Definition
Presentation transcript:

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

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

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

Time windows and penalties

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

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

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

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)

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

Vehicle 1 Vehicle 2Vehicle 1 Vehicle 2 Move Move Operation

Vehicle 1Vehicle 2Vehicle 1Vehicle 2 Exchange Exchange Operation

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)

Neigbourhood Example

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

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

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)

4 5 vehicles no transhipment

4 4 vehicles pickups at store w/o vehicle

4 vehicles with transhipment at stores

44 4 vehicles with transhipment at common location

Collaborative Distribution in Melbourne

Independent Networks from suppliers

Collaborative Network Around 20% saving in distance travelled

B2C Food Items

Single Urban DC

Regional DC’s

VKT with 1 DC

VKT with regional DCs

E-commerce supermarket home delivery network

Extended length, 36 Mail Cages Rigid

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

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

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

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

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)

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., Taniguchi, E. and R.G. Thompson (2003). Predicting the effects of city logistics schemes, Transport Reviews, Vol. 23, No. 4, Taniguchi, E. and R.G. Thompson (2002). Modeling City Logistics, Transportation Research Record, No. 1790, Transportation Research Board, National Research Council, Washington DC, 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 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 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,

© Copyright The University of Melbourne 2011