考虑顾客-消费者送货地点偏好的基于大规模邻域搜索算法的送货车辆路线优化

Xiang Niu, S.F. Liu, Q. Huang
{"title":"考虑顾客-消费者送货地点偏好的基于大规模邻域搜索算法的送货车辆路线优化","authors":"Xiang Niu, S.F. Liu, Q. Huang","doi":"10.14743/apem2022.4.447","DOIUrl":null,"url":null,"abstract":"Logistics is an important guarantee for economic and social development. Among the various aspects of logistics, the urban logistics end distribution link, which involves the direct connection between distribution personnel and customers, has a direct impact on customers' sense of experience and satisfaction with logistics services. At present, there are unscientific and unreasonable selection methods for logistics end distribution paths, often based on the subjective experience of distribution personnel, which often results in a mismatch between distribution paths and distribution needs, affecting market demand while further increasing the distribution costs of enterprises. Therefore, based on the characteristics of customer-consumers, this paper considers that consumers can select multiple receiving addresses, and each address has a corresponding time window limit. This paper finds that it needs to spend a lot of costs for the enterprise to improve the service level of distribution, and the enterprise can save the cost from time window, as well as obtain the better distribution time by using alternative addresses through the verification and analysis of an example. Based on the above analysis, this paper proposes the urban logistics terminal distribution path optimization path based on large-scale neighbourhood search algorithm, which can promote the further matching between logistics distribution enterprises and customer needs, so as to improve the probability of consumers receiving goods in time as well as reduce the cost of enterprises.","PeriodicalId":445710,"journal":{"name":"Advances in Production Engineering & Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"End-of-line delivery vehicle routing optimization based on large-scale neighbourhood search algorithms considering customer-consumer delivery location preferences\",\"authors\":\"Xiang Niu, S.F. Liu, Q. Huang\",\"doi\":\"10.14743/apem2022.4.447\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Logistics is an important guarantee for economic and social development. Among the various aspects of logistics, the urban logistics end distribution link, which involves the direct connection between distribution personnel and customers, has a direct impact on customers' sense of experience and satisfaction with logistics services. At present, there are unscientific and unreasonable selection methods for logistics end distribution paths, often based on the subjective experience of distribution personnel, which often results in a mismatch between distribution paths and distribution needs, affecting market demand while further increasing the distribution costs of enterprises. Therefore, based on the characteristics of customer-consumers, this paper considers that consumers can select multiple receiving addresses, and each address has a corresponding time window limit. This paper finds that it needs to spend a lot of costs for the enterprise to improve the service level of distribution, and the enterprise can save the cost from time window, as well as obtain the better distribution time by using alternative addresses through the verification and analysis of an example. Based on the above analysis, this paper proposes the urban logistics terminal distribution path optimization path based on large-scale neighbourhood search algorithm, which can promote the further matching between logistics distribution enterprises and customer needs, so as to improve the probability of consumers receiving goods in time as well as reduce the cost of enterprises.\",\"PeriodicalId\":445710,\"journal\":{\"name\":\"Advances in Production Engineering & Management\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Production Engineering & Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14743/apem2022.4.447\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Production Engineering & Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14743/apem2022.4.447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

物流是经济社会发展的重要保障。在物流的各个环节中,城市物流端配送环节涉及配送人员与客户之间的直接联系,直接影响着客户对物流服务的体验感和满意度。目前,物流端配送路径的选择方法不科学、不合理,往往基于配送人员的主观经验,往往导致配送路径与配送需求不匹配,在影响市场需求的同时进一步增加了企业的配送成本。因此,根据客户-消费者的特点,本文认为消费者可以选择多个接收地址,每个地址都有相应的时间窗口限制。本文通过实例验证和分析发现,企业提高配送服务水平需要花费大量的成本,企业可以从时间窗口中节省成本,并通过使用备选地址获得更好的配送时间。基于以上分析,本文提出了基于大规模邻域搜索算法的城市物流终端配送路径优化路径,可以促进物流配送企业与客户需求的进一步匹配,从而提高消费者及时收到货物的概率,降低企业成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
End-of-line delivery vehicle routing optimization based on large-scale neighbourhood search algorithms considering customer-consumer delivery location preferences
Logistics is an important guarantee for economic and social development. Among the various aspects of logistics, the urban logistics end distribution link, which involves the direct connection between distribution personnel and customers, has a direct impact on customers' sense of experience and satisfaction with logistics services. At present, there are unscientific and unreasonable selection methods for logistics end distribution paths, often based on the subjective experience of distribution personnel, which often results in a mismatch between distribution paths and distribution needs, affecting market demand while further increasing the distribution costs of enterprises. Therefore, based on the characteristics of customer-consumers, this paper considers that consumers can select multiple receiving addresses, and each address has a corresponding time window limit. This paper finds that it needs to spend a lot of costs for the enterprise to improve the service level of distribution, and the enterprise can save the cost from time window, as well as obtain the better distribution time by using alternative addresses through the verification and analysis of an example. Based on the above analysis, this paper proposes the urban logistics terminal distribution path optimization path based on large-scale neighbourhood search algorithm, which can promote the further matching between logistics distribution enterprises and customer needs, so as to improve the probability of consumers receiving goods in time as well as reduce the cost of enterprises.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimizing smart manufacturing systems using digital twin IoT-based Deep Learning Neural Network (DLNN) algorithm for voltage stability control and monitoring of solar power generation Reduction of surface defects by optimization of casting speed using genetic programming: An industrial case study Incentive modeling analysis in engineering applications and projects with stochastic duration time Comparing Fault Tree Analysis methods combined with Generalized Grey Relation Analysis: A new approach and case study in the automotive industry
×
引用
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