Bidirectional labeling for solving vehicle routing and truck driver scheduling problems

Christian Tilk () and Asvin Goel ()
Additional contact information
Christian Tilk: Johannes Gutenberg University Mainz
Asvin Goel: Kühne Logistics University

No 1914, Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz

Abstract: This paper studies the vehicle routing and truck driver scheduling problem where routes and schedules must comply with hours of service regulations for truck drivers. It presents a backward labeling method for generating feasible schedules and shows how the labels generated with the backward method can be combined with labels generated by a forward labeling method. The bidirectional labeling is embedded into a branch and-price-and-cut approach and evaluated for hours of service regulations in the United States and the European Union. Computational experiments show that the resulting bidirectional branch-and-price-and-cut approach is signi?cantly faster than unidirectional counterparts and previous approaches.

Keywords: Routing; Hours of service regulations; truck driver scheduling; bidirectional labeling; branch and-price-and-cut (search for similar items in EconPapers)
Pages: 38 pages
Date: 2019-07-15
New Economics Papers: this item is included in nep-cmp, nep-tre and nep-ure
References: Add references at CitEc
Citations:

Downloads: (external link)
https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1914.pdf First version, 2019 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jgu:wpaper:1914

Access Statistics for this paper

More papers in Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz Contact information at EDIRC.
Bibliographic data for series maintained by Research Unit IPP ().