Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers’ rules
Authors:
- 12 June 2010
- journal article
- Published by Emerald Publishing in Logistics Research
- Vol. 2 (2) , 79-96
Abstract
This paper describes how drivers’ rules according to EU social legislation can be formally modelled using the resource concept and how ‘legal’ vehicle routes and schedules can be computed by exact and heuristic labelling algorithms for solving the elementary shortest path problem with resource constraints.Keywords
This publication has 14 references indexed in Scilit:
- European Driver Rules in Vehicle Routing with Time WindowsTransportation Science, 2010
- Vehicle Scheduling and Routing with Drivers' Working HoursTransportation Science, 2009
- Truck Driver Scheduling and Regulation (EC) No 561/2006SSRN Electronic Journal, 2009
- A dynamic driver management scheme for less-than-truckload carriersComputers & Operations Research, 2008
- Multi-period vehicle routing and crew scheduling with outsourcing optionsInternational Journal of Production Economics, 2008
- Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportationOR Spectrum, 2007
- Solving a Practical Pickup and Delivery ProblemTransportation Science, 2003
- 7. VRP with Time Windows2002
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problemEuropean Journal of Operational Research, 1997
- Local search in routing problems with time windowsAnnals of Operations Research, 1985