Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/103728 
Year of Publication: 
2013
Citation: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 6 [Issue:] 2 [Publisher:] VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research [Place:] Göttingen [Year:] 2013 [Pages:] 242-264
Publisher: 
VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research, Göttingen
Abstract: 
This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-distance road transport in Europe: Pickup-and-delivery requests have to be fulfilled over a multi-period planning horizon by a heterogeneous fleet of trucks and drivers. Typically, in the vehicle routing literature, a fixed assignment of a driver to a truck is assumed. In our approach, we abandon this assumption and allow truck/driver changes at geographically dispersed relay stations. This offers greater planning flexibility and allows a better utilization of trucks, but also creates intricate interdependencies between trucks and drivers and requires the synchronization of their routes. A solution heuristic based on a two-stage decomposition of the problem is developed, taking into account European Union social legislation for drivers, and computational experiments using real-world data provided by a major German forwarder are presented and analyzed. The obtained results suggest that for the vehicle and driver cost structure prevalent in Western Europe and for transport requests that are not systematically acquired to complement one another, no cost savings are possible through simultaneous vehicle and crew routing and scheduling, although no formal proof of this fact is possible.
Subjects: 
crew scheduling
full truckload transportation
synchronization
vehicle routing
Persistent Identifier of the first edition: 
Document Type: 
Article

Files in This Item:
File
Size
395.2 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.