欧洲公路运输车队司机工作时间安排

A. Goel
{"title":"欧洲公路运输车队司机工作时间安排","authors":"A. Goel","doi":"10.2139/ssrn.1532148","DOIUrl":null,"url":null,"abstract":"Since April 2007 working hours of truck drivers in the European Union must comply with regulation (EC) No 561/2006. According to the new regulation, transport companies must organise the work of drivers in a way that drivers are able to comply with the regulation and can be made liable for infringements committed by the drivers. Although of particular importance in long-distance haulage, regulations on working hours of truck drivers have only received very little attention in the scheduling literature. Generating work plans complying with these regulations is a non-trivial task if service times at the locations to be visited is time constrained. This paper presents an algorithm for scheduling problems in which a team of two drivers must visit a sequence of locations within given time windows. Computational experiments demonstrate the effectiveness of the proposed method.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Scheduling Working Hours of Team Drivers in European Road Transport\",\"authors\":\"A. Goel\",\"doi\":\"10.2139/ssrn.1532148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since April 2007 working hours of truck drivers in the European Union must comply with regulation (EC) No 561/2006. According to the new regulation, transport companies must organise the work of drivers in a way that drivers are able to comply with the regulation and can be made liable for infringements committed by the drivers. Although of particular importance in long-distance haulage, regulations on working hours of truck drivers have only received very little attention in the scheduling literature. Generating work plans complying with these regulations is a non-trivial task if service times at the locations to be visited is time constrained. This paper presents an algorithm for scheduling problems in which a team of two drivers must visit a sequence of locations within given time windows. Computational experiments demonstrate the effectiveness of the proposed method.\",\"PeriodicalId\":374055,\"journal\":{\"name\":\"Scheduling eJournal\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scheduling eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.1532148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scheduling eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1532148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

自2007年4月起,欧盟卡车司机的工作时间必须符合法规(EC) No 561/2006。根据新规定,运输公司必须以一种司机能够遵守规定的方式组织司机的工作,并且可以对司机的违规行为负责。尽管在长途运输中对卡车司机的工作时间的规定特别重要,但在调度文献中只受到很少的关注。如果要访问的地点的服务时间有限,则生成符合这些规定的工作计划是一项重要的任务。本文提出了一种求解由两个司机组成的车队必须在给定的时间窗口内访问一系列地点的调度问题的算法。计算实验证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling Working Hours of Team Drivers in European Road Transport
Since April 2007 working hours of truck drivers in the European Union must comply with regulation (EC) No 561/2006. According to the new regulation, transport companies must organise the work of drivers in a way that drivers are able to comply with the regulation and can be made liable for infringements committed by the drivers. Although of particular importance in long-distance haulage, regulations on working hours of truck drivers have only received very little attention in the scheduling literature. Generating work plans complying with these regulations is a non-trivial task if service times at the locations to be visited is time constrained. This paper presents an algorithm for scheduling problems in which a team of two drivers must visit a sequence of locations within given time windows. Computational experiments demonstrate the effectiveness of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信