基于模拟退火的卡车和司机调度优化

N. A. C. M. Keerthisinghe, H. Bandara, N. A. Samarasekera
{"title":"基于模拟退火的卡车和司机调度优化","authors":"N. A. C. M. Keerthisinghe, H. Bandara, N. A. Samarasekera","doi":"10.1109/SOLI.2018.8476766","DOIUrl":null,"url":null,"abstract":"Truck and driver scheduling in multi-plant heavy goods distribution is a complex problem due to geographically distributed customer sites and plants, truck conditions, and working and resting hour constraints. Moreover, we need to satisfy conflicting objectives such as maximizing order coverage and minimizing of overall costs. We propose an automated truck and driver scheduling solution which consists of a rule checker and a scheduler. Rule checker enforces constraints and conditions such as driver and truck availability, delivery time constraints, and operating and resting hours. A scheduler that uses simulated annealing is proposed to cover as many orders as possible while minimizing the overall cost. The utility of the proposed solution is tested using a workload derived from a real-world bulk-cement distribution company. The results show good coverage of orders where the coverage increased by more than 10% compared to manual scheduling while minimizing the total cost by 35%, as well as enhancing the customer satisfaction and the safety of drivers.","PeriodicalId":424115,"journal":{"name":"2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of Truck and Driver Scheduling Using Simulated Annealing\",\"authors\":\"N. A. C. M. Keerthisinghe, H. Bandara, N. A. Samarasekera\",\"doi\":\"10.1109/SOLI.2018.8476766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Truck and driver scheduling in multi-plant heavy goods distribution is a complex problem due to geographically distributed customer sites and plants, truck conditions, and working and resting hour constraints. Moreover, we need to satisfy conflicting objectives such as maximizing order coverage and minimizing of overall costs. We propose an automated truck and driver scheduling solution which consists of a rule checker and a scheduler. Rule checker enforces constraints and conditions such as driver and truck availability, delivery time constraints, and operating and resting hours. A scheduler that uses simulated annealing is proposed to cover as many orders as possible while minimizing the overall cost. The utility of the proposed solution is tested using a workload derived from a real-world bulk-cement distribution company. The results show good coverage of orders where the coverage increased by more than 10% compared to manual scheduling while minimizing the total cost by 35%, as well as enhancing the customer satisfaction and the safety of drivers.\",\"PeriodicalId\":424115,\"journal\":{\"name\":\"2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOLI.2018.8476766\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2018.8476766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于客户地点和工厂的地理分布、卡车条件以及工作和休息时间的限制,多厂重货配送中的卡车和司机调度是一个复杂的问题。此外,我们需要满足相互冲突的目标,如最大化订单覆盖范围和最小化总成本。提出了一种由规则检查器和调度器组成的卡车和司机自动调度方案。规则检查器执行约束和条件,例如驾驶员和卡车的可用性、交付时间约束以及操作和休息时间。提出了一种使用模拟退火的调度程序,以覆盖尽可能多的订单,同时最小化总成本。使用来自现实世界散装水泥配送公司的工作负载测试了所提出的解决方案的实用性。结果表明,与人工调度相比,覆盖范围增加了10%以上的订单,同时将总成本降低了35%,并且提高了客户满意度和驾驶员的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Truck and Driver Scheduling Using Simulated Annealing
Truck and driver scheduling in multi-plant heavy goods distribution is a complex problem due to geographically distributed customer sites and plants, truck conditions, and working and resting hour constraints. Moreover, we need to satisfy conflicting objectives such as maximizing order coverage and minimizing of overall costs. We propose an automated truck and driver scheduling solution which consists of a rule checker and a scheduler. Rule checker enforces constraints and conditions such as driver and truck availability, delivery time constraints, and operating and resting hours. A scheduler that uses simulated annealing is proposed to cover as many orders as possible while minimizing the overall cost. The utility of the proposed solution is tested using a workload derived from a real-world bulk-cement distribution company. The results show good coverage of orders where the coverage increased by more than 10% compared to manual scheduling while minimizing the total cost by 35%, as well as enhancing the customer satisfaction and the safety of drivers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信