{"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.