Adaptive Large Neighbourhood Search for the Vehicle Routing Problem with Drivers Working Hours Asvin Goel MIT-Zaragoza International Logistics Program.

Slides:



Advertisements
Similar presentations
MENTORE: PILOT 2 – Tracking & Tracing Services for Livestock Transport Management MENTORE Event, 25 th November 2008 Galileo & EGNOS for Public Interest.
Advertisements

MFA for Business Banking – Security Code Multifactor Authentication: Quick Tip Sheets Note to Financial Institutions: We are providing these QT sheets.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Hours of service Supervisor Training for Property-Carrying Vehicles.
Submission Page 1 January 2002 doc.: IEEE 802.RR-02/018A-d1 Andrew Myles, Cisco Systems Report of ad hoc group relating to DFS and JPT5G proposal Andrew.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
1. HDD Partition Setup Insert Booting Diskette to A: drive and turn on the power. Then it will be boot by floppy diskette. 1 Type FDISK and press Enter.
Copyright © 2010 Pearson Education, Inc. Slide
Driver Certificate of Professional Competence Course One Drivers, Hours & Tachographs © Les Kelly 2010.
Presented By: Marvin Johnson & Associated, Inc. HOURS OF SERVICE.
Hours Of Service H O S Property-Carrying Four Rules 11 Hour Rule A Driver Shall not DRIVE more than 11 hours following the equivalent of at least 10.
COURSE REGISTRATION 101 Presented by Madison Advising Peers.
I-DMSS for Bus Rental in Seoul, Korea Katta G. Murty Dept. IOE, U. of Michigan Ann Arbor, MI , USA and Woo-Je Kim Dept.
Chapter 4: Informed Heuristic Search
Heuristics, and what to do if you dont know what to do Carl Hultquist.
© 2006 TDA Development Draft and subject to amendments from consultation Performance Management Challenge for Schools PM workshops 23 October 2006.
MTO Enforcement Program October 6, 2006 This is an unofficial interpretation of the federal Commercial Vehicle Drivers Hours of Service regulations that.
South Dakota Library Network ALEPH v20 Tables © South Dakota Library Network, 2012 ©Ex Libris (USA), 2009 Modified for SDLN Version Last Update:
1 of 27 DA1241 Archive Companies Last updated: March-2004 DA1241 Archive Companies.
Traffic assignment.
Logs. Qualcom Pings hourly telling where you are and how many miles you’ve driven in past hour Pings hourly telling where you are and how many miles you’ve.
February 2007 Commercial Vehicle Drivers Hours of Service Module 7: Deferral of Off-Duty Time.
Target Costing If you cannot find the time to do it right, how will you find the time to do it over?
Third Energy Package for Change of Supplier 2009/73/EC.
An Introduction to Artificial Intelligence
February 2007 Commercial Vehicle Drivers Hours of Service Module 14: Exemptions.
February 2007 Commercial Vehicle Drivers Hours of Service Module 16: North of 60.
Chapter 4: Trees Part II - AVL Tree
HOURS OF SERVICE Presented by: Ms Kim Durdle Director of Carrier Services
Property-Carrying Vehicles
DOMinant workshop, Molde, September 20-22, 2009
Branch & Bound Algorithms
Vehicle Routing & Scheduling: Part 1
Hours of Service LOGBOOK Examples
Unifying Local and Exhaustive Search John Hooker Carnegie Mellon University September 2005.
1 Introduction to Transportation Systems. 2 PART II: FREIGHT TRANSPORTATION.
Vehicle Routing & Scheduling
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 5: February 2, 2009 Architecture Synthesis (Provisioning, Allocation)
Randomized Algorithms. Introduction Algorithm uses a random number to make at least one decision Running time depends on input and random numbers generated.
OPERATING SAFELY AND IN COMPLIANCE James Daulerio CDS CDT Senior Risk Consultant.
Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
MTO Enforcement Program April, 2006 Hours of Service.
Inter-Link Services Inc. January 1, 2007 Hours of Service.
1 ISA Server 2004 Installation & Configuration Overview By Nicholas Quinn.
Quality Management Legislation and private requirements.
FTES and Attendance Accounting Putting the Pieces Together.
February 2007 Commercial Vehicle Drivers Hours of Service Module 23: Enforcement Action.
February 2007 Commercial Vehicle Drivers Hours of Service Module 6: Work Shift Limits.
Transportation of Hazardous Materials. Applicability Each officer or employee of the motor carrier who performs duties related to the transportation of.
Heuristic Optimization Methods Tabu Search: Advanced Topics.
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
February 2007 Commercial Vehicle Drivers Hours of Service Module 9: Cycles.
Search CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Basic Problem Solving Search strategy  Problem can be solved by searching for a solution. An attempt is to transform initial state of a problem into some.
Problem Reduction So far we have considered search strategies for OR graph. In OR graph, several arcs indicate a variety of ways in which the original.
Chapter 9 Finding the Optimum 9.1 Finding the Best Tree.
M mc EU ROAD TRANSPORT POLICY AND INFRAESTRUCTURE Directive 2003/59/EC. Driver Training Ankara, 19/20 September 2006.
Dynamic Programming & Memoization. When to use? Problem has a recursive formulation Solutions are “ordered” –Earlier vs. later recursions.
Fleet Operator Recognition Scheme (FORS)
1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.
© International Road Transport Union (IRU) 2005 Page 1 New Driving & Rest Time Rules (Revision of Regulation 3820 / 85) 2 nd Reading: European Parliament.
Hours of Service The Ontario “Hours of Service” Regulation 555/06 made under the HIGHWAY TRAFFIC ACT that came into force on January 1, January 1,
Open Addressing: Quadratic Probing
Hours of Service Regulations
WORKING HOURS.
BEST FIRST SEARCH -OR Graph -A* Search -Agenda Search CSE 402
TOOLBOX TALKS Introduce yourself and the talk
Presentation transcript:

Adaptive Large Neighbourhood Search for the Vehicle Routing Problem with Drivers Working Hours Asvin Goel MIT-Zaragoza International Logistics Program Zaragoza Logistics Center EU/ME 08, Troyes, 23 th October – 24 th October 2008

Drivers working hours New EC regulation 561/2006 entered into force in April 2007 Shippers and carriers can be made liable for infringements committed by the drivers Carriers must organise the work of drivers in such a way that drivers are able to comply with the respective regulations

Provisions of EC regulation 561/ After a driving period (i.e. the accumulated driving time between subsequent breaks and rest periods) of 4½ hours a driver shall take an uninterrupted break of not less than 45 minutes, unless she/he takes a rest period. 2.The daily driving time (i.e. the accumulated driving time between the end of one daily or weekly rest period and the beginning of the following daily or weekly rest period) shall not exceed 9 hours. A regular daily rest period is any period of rest of at least 11 hours.

Provisions of EC regulation 561/2006 (continued) 3.Within each period of 24 hours after the end of the previous daily rest period a driver shall have taken a new daily rest period. 4.The weekly driving time (i.e. the accumulated driving time during a week) shall not exceed 56 hours. 5.A weekly rest period shall start no later than 144 hours after the end of the previous weekly rest period.

Examples A time constrained example with alternative schedules:

Further provisions of EC regulation 561/2006 (not considered in the remainder) 6.The daily driving time may be extended to at most 10 hours not more than twice during the week. 7.The daily rest period may be reduced to 9 hours not more than 3 times during the week. 8.The break may be replaced by a break of at least 15 minutes followed by a break of at least 30 minutes. 9.The daily rest period may be taken in two periods, the first of which must be an uninterrupted period of at least 3 hours and the second an uninterrupted period of at least 9 hours.

Extended daily driving times and reduced daily rest periods In case of delays extended daily driving times and reduced daily rest periods can be used to repair otherwise infeasible schedules:

Splitting up regular breaks EC regulation 561/2006 explicitly states the following reason for replacing the old regulation: It has proved possible under the rules of Regulation (EEC) No 3820/85 to schedule daily driving periods and breaks to enable a driver to drive for too long without a full break, leading to reduced road safety and a deterioration in the drivers working conditions. For t ! 0 the goal of the new regulation is not achieved!!!

Naïve method for scheduling with drivers working hours Drive as long as possible Stop if destination is reached Add daily rest period if required Add break

Naïve method for scheduling with drivers working hours (continued) Let n be the first node in tour Repeat while n is not last node in tour Determine labels for successor node of n using the naïve method If there is enough slack between arrival and begin of time window add break or rest period Set n à successor node of n

Limitations of naïve method found by naïve method Not found by naïve method

Multi-label method for scheduling with drivers working hours Drive as long as possible Add label if destination is reached Add daily rest period if required Add break Generate new label with additional rest period Recursively call method to expand new label

Multi-label method for scheduling with drivers working hours (continued) Let n be the first node in tour Repeat while n is not last node in tour Determine all labels for successor node of n using the multi-label method Copy each label calculated by the multi-label method and add optional break and rest period Delete all dominated labels Set n à successor node of n

Naïve vs. Multi-label method found by naïve method found by multi- label method

Include provisions not considered thus far So far provision 3 has not been considered: Within each period of 24 hours after the end of the previous daily rest period a driver shall have taken a new daily rest period. Increase duration of rest periods in order to make sure that all daily rest periods are completed within the 24 hour limit (not always possible!!!)

Large Neighbourhood Search Initialisation: Find an initial solution s choose a stopping condition Repeat the following until the stopping condition is met: Choose a number k Until k customers are removed from their tour repeat: –Randomly choose a customer n to be removed –Remove customer n from its tour if naïve or multi-label method for scheduling drivers working hours finds a feasible solution Apply an insertion method to re-insert all removed customers If all customers are re-inserted and the modified solution s has lower costs than the current solution s set s := s

Concluding Remarks Drivers working hours have significant impact on total travel times Carriers can be made liable for infringements committed by the drivers Labelling methods can be used to generate tours complying with the new regulations Computational experiments have shown that LNS based on multi-label approach significantly outperforms LNS based on naïve method for scheduling drivers working hours Current and future research will study how to remove customers more effectively, in particular for PDP-DWH

Thank you! Merci! Asvin Goel MIT-Zaragoza International Logistics Program Zaragoza Logistics Center