Application Research of Factor Constraint Algorithm in E-Commerce Logistics Route Optimization

Chen Li, Jingying Ke, Linghan Cai
{"title":"Application Research of Factor Constraint Algorithm in E-Commerce Logistics Route Optimization","authors":"Chen Li, Jingying Ke, Linghan Cai","doi":"10.31181/dmame712024932","DOIUrl":null,"url":null,"abstract":"In modern society, e-commerce logistics services are replacing traditional manual transportation methods. However, fresh transportation challenges have emerged. This study proposes applying the factor constraint algorithm to the e-commerce logistics path transportation problem. The multi-objective constraints and optimization of node tasks, vehicle full load, route closure, and other issues in the process of logistics transportation are firstly carried out. The final target is the shortest path of logistics deliver. Then the genetic algorithm, particle swarm algorithm, and ant colony algorithm are integrated to obtain the HMOAC algorithm, and the logistics path transportation model is constructed. The research findings indicate that the HMOAC algorithm shows a high level of fit, with a 95% match compared to the ant colony algorithm. An example analysis of the algorithm can effectively optimize the target path and achieve the least expensive transportation cost.","PeriodicalId":504436,"journal":{"name":"Decision Making: Applications in Management and Engineering","volume":"14 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Decision Making: Applications in Management and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31181/dmame712024932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In modern society, e-commerce logistics services are replacing traditional manual transportation methods. However, fresh transportation challenges have emerged. This study proposes applying the factor constraint algorithm to the e-commerce logistics path transportation problem. The multi-objective constraints and optimization of node tasks, vehicle full load, route closure, and other issues in the process of logistics transportation are firstly carried out. The final target is the shortest path of logistics deliver. Then the genetic algorithm, particle swarm algorithm, and ant colony algorithm are integrated to obtain the HMOAC algorithm, and the logistics path transportation model is constructed. The research findings indicate that the HMOAC algorithm shows a high level of fit, with a 95% match compared to the ant colony algorithm. An example analysis of the algorithm can effectively optimize the target path and achieve the least expensive transportation cost.
要素约束算法在电子商务物流线路优化中的应用研究
在现代社会,电子商务物流服务正在取代传统的人工运输方式。然而,新的运输挑战也随之出现。本研究提出将因子约束算法应用于电商物流路径运输问题。首先对物流运输过程中的节点任务、车辆满载、路线封闭等问题进行多目标约束和优化。最终以物流运送的最短路径为目标。然后综合运用遗传算法、粒子群算法和蚁群算法,得到 HMOAC 算法,并构建了物流路径运输模型。研究结果表明,HMOAC 算法的拟合度较高,与蚁群算法相比,拟合度高达 95%。通过实例分析,该算法能有效优化目标路径,实现运输成本最低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信