Truck Driver Scheduling and U.S. Hours of Service Regulations

A. Goel
{"title":"Truck Driver Scheduling and U.S. Hours of Service Regulations","authors":"A. Goel","doi":"10.2139/ssrn.1407509","DOIUrl":null,"url":null,"abstract":"In the United States of America driving and working hours of truck drivers must comply with the hours of service regulations imposed by the U.S. Department of Transportation. Generating work plans complying with these regulations for a given sequence of locations to be visited is a non-trivial task if the service time at these locations is time constrained. For a planning horizon of one week this paper presents an O(\\lambda^3) algorithm for problems in which each location must be visited within one of multiple time windows if the gap between these time windows is at least 10 hours. This situation occurs, for example, if, because of opening hours of docks, handling operations can only be performed weekdays between 8 hours and 22 hours. Furthermore, this paper presents a heuristic approach for scheduling driving and working hours of truck drivers for planning horizons of more than one week.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scheduling eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1407509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the United States of America driving and working hours of truck drivers must comply with the hours of service regulations imposed by the U.S. Department of Transportation. Generating work plans complying with these regulations for a given sequence of locations to be visited is a non-trivial task if the service time at these locations is time constrained. For a planning horizon of one week this paper presents an O(\lambda^3) algorithm for problems in which each location must be visited within one of multiple time windows if the gap between these time windows is at least 10 hours. This situation occurs, for example, if, because of opening hours of docks, handling operations can only be performed weekdays between 8 hours and 22 hours. Furthermore, this paper presents a heuristic approach for scheduling driving and working hours of truck drivers for planning horizons of more than one week.
卡车司机调度和美国服务时间规定
在美国,卡车司机的驾驶和工作时间必须遵守美国交通部规定的服务时间。如果在这些地点的服务时间受到时间限制,那么为要访问的给定地点序列生成符合这些规定的工作计划是一项非常重要的任务。对于一周的规划范围,本文提出了一种O(\lambda^3)算法,用于解决必须在多个时间窗口中的一个内访问每个位置,并且这些时间窗口之间的间隔至少为10小时的问题。例如,由于码头的开放时间,装卸作业只能在工作日的8小时至22小时之间进行,就会出现这种情况。此外,本文还提出了一种启发式方法,用于规划一周以上的卡车司机驾驶和工作时间的调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信