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

IF 4.1 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.1000,"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好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
Routing and driver break scheduling with working and driving regulations: A flexible approach for various general pickup and delivery problem variants Multi-neighborhood simulated annealing for the oven scheduling problem Knowledge graph based question-answering model with subgraph retrieval optimization A branch-and-cut-and-price algorithm for shared mobility considering customer satisfaction Improved A* algorithm incorporating RRT* thought: A path planning algorithm for AGV in digitalised workshops
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1