设计具有视觉和操作吸引力的路线,以提高司机对道路清洁车辆路线问题的接受度

IF 4.6 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-05-01 Epub Date: 2025-01-07 DOI:10.1016/j.cor.2025.106973
Mingwei Chen, Xiaofang Wang, Linning Cai, Liang Ma
{"title":"设计具有视觉和操作吸引力的路线,以提高司机对道路清洁车辆路线问题的接受度","authors":"Mingwei Chen,&nbsp;Xiaofang Wang,&nbsp;Linning Cai,&nbsp;Liang Ma","doi":"10.1016/j.cor.2025.106973","DOIUrl":null,"url":null,"abstract":"<div><div>As urbanization accelerates, the planning of effective operating routes for urban road cleaning fleets has become a significant concern for municipalities. However, traditional vehicle routing algorithms often overlook drivers’ route preferences, resulting in poor driver acceptance. This study aims to design routes that are simultaneously cost-effective and attractive to drivers, thereby facilitating the implementation of efficient algorithms. Based on an analysis of road cleaning tasks and driver behavior, we introduce the concept of ”operational attractiveness” to complement the notion of visual attractiveness in road cleaning contexts. Two strategies are proposed for improving driver acceptance: imitating drivers’ routing behavior and reducing route overlap. The first strategy enhances the operational attractiveness of the route, while the second focuses on its visual attractiveness. We have integrated these two strategies into Randomized-Merge (RM), which is known for its remarkable cost-optimization performance. Numerical experiments on one real-world instance and ten new randomly generated instances show that the proposed heuristics can generate routes with lower cost than RM. Moreover, these routes are more attractive based on operational and visual metrics.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106973"},"PeriodicalIF":4.6000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem\",\"authors\":\"Mingwei Chen,&nbsp;Xiaofang Wang,&nbsp;Linning Cai,&nbsp;Liang Ma\",\"doi\":\"10.1016/j.cor.2025.106973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>As urbanization accelerates, the planning of effective operating routes for urban road cleaning fleets has become a significant concern for municipalities. However, traditional vehicle routing algorithms often overlook drivers’ route preferences, resulting in poor driver acceptance. This study aims to design routes that are simultaneously cost-effective and attractive to drivers, thereby facilitating the implementation of efficient algorithms. Based on an analysis of road cleaning tasks and driver behavior, we introduce the concept of ”operational attractiveness” to complement the notion of visual attractiveness in road cleaning contexts. Two strategies are proposed for improving driver acceptance: imitating drivers’ routing behavior and reducing route overlap. The first strategy enhances the operational attractiveness of the route, while the second focuses on its visual attractiveness. We have integrated these two strategies into Randomized-Merge (RM), which is known for its remarkable cost-optimization performance. Numerical experiments on one real-world instance and ten new randomly generated instances show that the proposed heuristics can generate routes with lower cost than RM. Moreover, these routes are more attractive based on operational and visual metrics.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"177 \",\"pages\":\"Article 106973\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2025-05-01\",\"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/S0305054825000012\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/7 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000012","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/7 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

随着城市化的加速,规划城市道路清洁车队的有效运营路线已成为市政当局关注的一个重大问题。然而,传统的车辆路径算法往往忽略了驾驶员的路线偏好,导致驾驶员接受度较差。本研究旨在设计同时具有成本效益和对驾驶员有吸引力的路线,从而促进高效算法的实施。在分析道路清洁任务和驾驶员行为的基础上,我们引入了“操作吸引力”的概念,以补充道路清洁背景下视觉吸引力的概念。提出了两种提高司机接受度的策略:模仿司机的路线行为和减少路线重叠。第一种策略是提高线路的运营吸引力,第二种策略是提高线路的视觉吸引力。我们将这两种策略整合到随机合并(RM)中,RM以其显著的成本优化性能而闻名。在一个实际实例和十个新随机生成实例上的数值实验表明,所提出的启发式算法生成的路由成本低于RM算法。此外,基于操作和视觉指标,这些路线更具吸引力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem
As urbanization accelerates, the planning of effective operating routes for urban road cleaning fleets has become a significant concern for municipalities. However, traditional vehicle routing algorithms often overlook drivers’ route preferences, resulting in poor driver acceptance. This study aims to design routes that are simultaneously cost-effective and attractive to drivers, thereby facilitating the implementation of efficient algorithms. Based on an analysis of road cleaning tasks and driver behavior, we introduce the concept of ”operational attractiveness” to complement the notion of visual attractiveness in road cleaning contexts. Two strategies are proposed for improving driver acceptance: imitating drivers’ routing behavior and reducing route overlap. The first strategy enhances the operational attractiveness of the route, while the second focuses on its visual attractiveness. We have integrated these two strategies into Randomized-Merge (RM), which is known for its remarkable cost-optimization performance. Numerical experiments on one real-world instance and ten new randomly generated instances show that the proposed heuristics can generate routes with lower cost than RM. Moreover, these routes are more attractive based on operational and visual metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Resilience enhancement in power distribution systems: Chance-constrained model with decision-dependent atoms A parallel branch-and-bound-and-check algorithm for nesting The vehicle routing problem with driver scheduling Modeling and optimization of machine deterioration effects in low-carbon flexible job shop scheduling problems Data-driven interdiction with asymmetric cost uncertainty: A distributionally robust optimization approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1