考虑物理工作负荷的分割配送开放车辆路径问题的遗传算法

Tarit Rattanamanee
{"title":"考虑物理工作负荷的分割配送开放车辆路径问题的遗传算法","authors":"Tarit Rattanamanee","doi":"10.1109/RI2C51727.2021.9559769","DOIUrl":null,"url":null,"abstract":"Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.","PeriodicalId":422981,"journal":{"name":"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Genetic Algorithm for Split Delivery Open Vehicle Routing Problem with Physical Workload Consideration\",\"authors\":\"Tarit Rattanamanee\",\"doi\":\"10.1109/RI2C51727.2021.9559769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.\",\"PeriodicalId\":422981,\"journal\":{\"name\":\"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RI2C51727.2021.9559769\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RI2C51727.2021.9559769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最后一英里配送是城市物流活动的重要组成部分。通常,送货员需要在客户所在地手动卸货。这些体力劳动会引起工人的生理疲劳,并增加交货时间。本文讨论了一种遗传算法(GA)来解决带有分离配送的开放式车辆路径问题(SDOVRP),其中解决了人工卸载问题。工人被预先分配到车辆上,并且允许分批交货。其目标是尽量减少车辆和运送工人的总固定成本和总运输成本的总成本。为了安全起见,每个工人的总体力负荷不得超过每日限额。由于优化方法无法在合理的计算时间内找到最优解,特别是在求解大型问题时。为了解决这一问题,提出了一种启发式的遗传算法。计算实验结果表明,该方法是有效的,可以得到接近最优的SDOVRP解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Genetic Algorithm for Split Delivery Open Vehicle Routing Problem with Physical Workload Consideration
Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信