Routing and driver break scheduling with working and driving regulations: A flexible approach for various general pickup and delivery problem variants

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-02-06 DOI:10.1016/j.cor.2025.107001
Ning Xue, Huan Jin, Tianxiang Cui
{"title":"Routing and driver break scheduling with working and driving regulations: A flexible approach for various general pickup and delivery problem variants","authors":"Ning Xue,&nbsp;Huan Jin,&nbsp;Tianxiang Cui","doi":"10.1016/j.cor.2025.107001","DOIUrl":null,"url":null,"abstract":"<div><div>This paper provides a solution to the driver break scheduling problem that can be integrated into current solvers for the generalised pick-up and delivery problem (GPDP) with a negligible increase in development costs. The driver break scheduling problem affects truck drivers who are required to adhere to working time and/or driving time regulations that oblige them to take mandatory breaks. These regulations are in force in many countries across the European Union, Great Britain, Australia, New Zealand, and the United States. We propose a flexible solution strategy that combines routing with driver break scheduling, taking into account both Regulations (EC)561/2006 and 2002/15/EC within a single day of operation. We deliberately incorporate driver breaks into the routes generated, with the aim of minimising route duration. The method proposed in this paper is particularly beneficial for the solvers that have not initially implemented driver break rules but need to introduce this functionality to accommodate customers, given the critical nature of driver break rules for effective scheduling. This is a flexible approach because the method proposed here can be applied directly to any individual route and at any stage of the scheduling process. For instance, it can be used during the constructive heuristic or the improvement heuristic phases. It is also applicable at the column generation stage of an exact method after a route has been constructed. This method is particularly beneficial when a human scheduler wishes to make manual adjustments along a single route, such as adding or removing an order from the route. Experimental analyses, grounded in two benchmark instances, affirm the efficacy of the proposed method. Results indicate that the method yields a 6.1% decrease in distance, a 1.7% reduction in duty time, and a 1.1% decrease in the number of unassigned tasks when contrasted with the standard compliant approach. We also offer guidance on how to tailor this method for driver break scheduling in accordance with the regulatory standards of Australia and New Zealand.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 107001"},"PeriodicalIF":4.3000,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000292","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper provides a solution to the driver break scheduling problem that can be integrated into current solvers for the generalised pick-up and delivery problem (GPDP) with a negligible increase in development costs. The driver break scheduling problem affects truck drivers who are required to adhere to working time and/or driving time regulations that oblige them to take mandatory breaks. These regulations are in force in many countries across the European Union, Great Britain, Australia, New Zealand, and the United States. We propose a flexible solution strategy that combines routing with driver break scheduling, taking into account both Regulations (EC)561/2006 and 2002/15/EC within a single day of operation. We deliberately incorporate driver breaks into the routes generated, with the aim of minimising route duration. The method proposed in this paper is particularly beneficial for the solvers that have not initially implemented driver break rules but need to introduce this functionality to accommodate customers, given the critical nature of driver break rules for effective scheduling. This is a flexible approach because the method proposed here can be applied directly to any individual route and at any stage of the scheduling process. For instance, it can be used during the constructive heuristic or the improvement heuristic phases. It is also applicable at the column generation stage of an exact method after a route has been constructed. This method is particularly beneficial when a human scheduler wishes to make manual adjustments along a single route, such as adding or removing an order from the route. Experimental analyses, grounded in two benchmark instances, affirm the efficacy of the proposed method. Results indicate that the method yields a 6.1% decrease in distance, a 1.7% reduction in duty time, and a 1.1% decrease in the number of unassigned tasks when contrasted with the standard compliant approach. We also offer guidance on how to tailor this method for driver break scheduling in accordance with the regulatory standards of Australia and New Zealand.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
路线和司机休息调度与工作和驾驶规则:一个灵活的方法,为各种一般皮卡和交付问题的变体
本文提供了一个司机休息调度问题的解决方案,该解决方案可以集成到当前的通用接送问题(GPDP)求解器中,而开发成本的增加可以忽略不计。司机休息安排问题影响到那些需要遵守工作时间和/或驾驶时间规定的卡车司机,这些规定迫使他们强制休息。这些法规在欧盟、英国、澳大利亚、新西兰和美国的许多国家都在实施。我们提出了一个灵活的解决方案策略,将路线和司机休息安排结合起来,在一天的运行中考虑到法规(EC)561/2006和2002/15/EC。我们故意将驾驶员的休息时间纳入生成的路线中,目的是尽量减少路线持续时间。本文提出的方法对于那些最初没有实现驾驶员违规规则但需要引入该功能以适应客户的求解器特别有益,因为驾驶员违规规则对于有效调度的关键性质。这是一种灵活的方法,因为这里提出的方法可以直接应用于任何单个路线和调度过程的任何阶段。例如,它可以在建设性启发式或改进启发式阶段使用。它也适用于路线构造完成后精确方法的列生成阶段。当人工调度程序希望沿着单个路线进行手动调整时,例如从路线中添加或删除订单,此方法特别有用。基于两个基准实例的实验分析证实了该方法的有效性。结果表明,与标准兼容方法相比,该方法的距离减少了6.1%,工作时间减少了1.7%,未分配任务数量减少了1.1%。我们还提供了如何根据澳大利亚和新西兰的监管标准定制驾驶员休息调度方法的指导。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Enhancing multi-agent deep reinforcement learning for flexible job-shop scheduling through constraint programming A knowledge-based matheuristic driven by dueling Q-learning for integrated task planning and lot-streaming scheduling in cloud manufacturing CORTEX-V: A cognitive reasoning toolkit for vision-based, cost-efficient layout optimization Editorial Board Knowledge-driven co-evolutionary algorithm for flexible job shop scheduling problem with consistent sublots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1