2019
DOI: 10.5445/ir/1000097855
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling and Routing of Truck Drivers Considering Regulations on Drivers’ Working Hours

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…The subproblem is solved with a general purpose mixed-integer programming solver. Kleff (2019) studies the problem of finding a time-dependent shortest path from an origin to a destination in which breaks can be taken at parking lots in the network. The driving time is limited by European Union regulations.…”
Section: Related Workmentioning
confidence: 99%
“…The subproblem is solved with a general purpose mixed-integer programming solver. Kleff (2019) studies the problem of finding a time-dependent shortest path from an origin to a destination in which breaks can be taken at parking lots in the network. The driving time is limited by European Union regulations.…”
Section: Related Workmentioning
confidence: 99%
“…This section explores both of these areas in view of the TDSP-IR challenges. Kleff (2019) introduced the first polynomial-time algorithm for the EU-TDSP when breaks are restricted to customer locations. The proposed algorithm is an LPA, but schedules are primarily represented using piecewise linear functions.…”
Section: Related Workmentioning
confidence: 99%
“…A natural question one might ask is whether the proposed LPA can be modified to produce schedules under United States regulations. To recall our literature review, generalizing an algorithm to address both EU and US regulations has been shown to be possible for the single-route TDSP by Goel (2012), Goel & Irnich (2017) and Kleff (2019).…”
Section: Addressing United States Regulationsmentioning
confidence: 99%