基于时间不确定性下多目标 Q 学习的多式联运路由优化

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
{"title":"基于时间不确定性下多目标 Q 学习的多式联运路由优化","authors":"","doi":"10.1007/s40747-023-01308-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Multimodal transportation is a modern way of cargo transportation. With the increasing demand for cargo transportation, higher requirements are being placed on multimodal transportation multi-objective routing optimization. In multimodal transportation multi-objective routing optimization, in response to the limitations of classical algorithms in solving large-scale problems with multiple nodes and modes of transport, the limitations of directed transportation networks in the application, and the uncertainty of transport time, this paper proposes an optimization framework based on multi-objective weighted sum <em>Q</em>-learning, combined with the proposed undirected multiple-node network, and characterizes the uncertainty of time with a positively skewed distribution. The undirected multiple-node transportation network can better simulate cargo transportation and characterize transfer information, facilitate the modification of origin and destination, and avoid suboptimal solutions due to the manual setting of wrong route directions. The network is combined with weighted sum <em>Q</em>-learning to solve multimodal transportation multi-objective routing optimization problems faster and better. When modeling the uncertainty of transport time, a positively skewed distribution is used. The three objectives of transport cost, carbon emission cost, and transport time were studied and compared with PSO, GA, AFO, NSGA-II, and MOPSO. The experimental results show that compared with PSO, GA, and AFO using a directed transportation network, the proposed method has a significant improvement in optimization results and running time, and the running time is shortened by 26 times. The proposed method can better solve the boundary of the Pareto front and dominate the partial solutions of NSGA-II and MOPSO. The effect of time uncertainty on the performance of the algorithm is more significant in transport orders with high time weight. With the increase in uncertainty, the reliability of the route decreases. The effectiveness of the proposed method is verified.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"49 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2024-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multimodal transportation routing optimization based on multi-objective Q-learning under time uncertainty\",\"authors\":\"\",\"doi\":\"10.1007/s40747-023-01308-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>Multimodal transportation is a modern way of cargo transportation. With the increasing demand for cargo transportation, higher requirements are being placed on multimodal transportation multi-objective routing optimization. In multimodal transportation multi-objective routing optimization, in response to the limitations of classical algorithms in solving large-scale problems with multiple nodes and modes of transport, the limitations of directed transportation networks in the application, and the uncertainty of transport time, this paper proposes an optimization framework based on multi-objective weighted sum <em>Q</em>-learning, combined with the proposed undirected multiple-node network, and characterizes the uncertainty of time with a positively skewed distribution. The undirected multiple-node transportation network can better simulate cargo transportation and characterize transfer information, facilitate the modification of origin and destination, and avoid suboptimal solutions due to the manual setting of wrong route directions. The network is combined with weighted sum <em>Q</em>-learning to solve multimodal transportation multi-objective routing optimization problems faster and better. When modeling the uncertainty of transport time, a positively skewed distribution is used. The three objectives of transport cost, carbon emission cost, and transport time were studied and compared with PSO, GA, AFO, NSGA-II, and MOPSO. The experimental results show that compared with PSO, GA, and AFO using a directed transportation network, the proposed method has a significant improvement in optimization results and running time, and the running time is shortened by 26 times. The proposed method can better solve the boundary of the Pareto front and dominate the partial solutions of NSGA-II and MOPSO. The effect of time uncertainty on the performance of the algorithm is more significant in transport orders with high time weight. With the increase in uncertainty, the reliability of the route decreases. The effectiveness of the proposed method is verified.</p>\",\"PeriodicalId\":10524,\"journal\":{\"name\":\"Complex & Intelligent Systems\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex & Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s40747-023-01308-9\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-023-01308-9","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

摘要 多式联运是一种现代货物运输方式。随着货物运输需求的不断增长,对多式联运多目标路由优化提出了更高的要求。在多式联运多目标路由优化中,针对经典算法在解决多节点、多运输方式的大规模问题中的局限性,有向运输网络在应用中的局限性,以及运输时间的不确定性,本文提出了一种基于多目标加权和Q-learning的优化框架,结合提出的无向多节点网络,以正偏分布表征时间的不确定性。无向多节点运输网络能更好地模拟货物运输和表征转运信息,便于修改起点和终点,避免因人工设置错误路线方向而导致的次优解。该网络与加权和 Q 学习相结合,能更快更好地解决多式联运多目标路由优化问题。在对运输时间的不确定性建模时,采用了正偏分布。研究了运输成本、碳排放成本和运输时间三个目标,并与 PSO、GA、AFO、NSGA-II 和 MOPSO 进行了比较。实验结果表明,与使用有向运输网络的 PSO、GA 和 AFO 相比,所提方法在优化结果和运行时间上都有显著改善,运行时间缩短了 26 倍。提出的方法能更好地求解帕累托前沿的边界,并在 NSGA-II 和 MOPSO 的部分解中占优势。在时间权重较高的运输订单中,时间不确定性对算法性能的影响更为显著。随着不确定性的增加,路线的可靠性也在降低。验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multimodal transportation routing optimization based on multi-objective Q-learning under time uncertainty

Abstract

Multimodal transportation is a modern way of cargo transportation. With the increasing demand for cargo transportation, higher requirements are being placed on multimodal transportation multi-objective routing optimization. In multimodal transportation multi-objective routing optimization, in response to the limitations of classical algorithms in solving large-scale problems with multiple nodes and modes of transport, the limitations of directed transportation networks in the application, and the uncertainty of transport time, this paper proposes an optimization framework based on multi-objective weighted sum Q-learning, combined with the proposed undirected multiple-node network, and characterizes the uncertainty of time with a positively skewed distribution. The undirected multiple-node transportation network can better simulate cargo transportation and characterize transfer information, facilitate the modification of origin and destination, and avoid suboptimal solutions due to the manual setting of wrong route directions. The network is combined with weighted sum Q-learning to solve multimodal transportation multi-objective routing optimization problems faster and better. When modeling the uncertainty of transport time, a positively skewed distribution is used. The three objectives of transport cost, carbon emission cost, and transport time were studied and compared with PSO, GA, AFO, NSGA-II, and MOPSO. The experimental results show that compared with PSO, GA, and AFO using a directed transportation network, the proposed method has a significant improvement in optimization results and running time, and the running time is shortened by 26 times. The proposed method can better solve the boundary of the Pareto front and dominate the partial solutions of NSGA-II and MOPSO. The effect of time uncertainty on the performance of the algorithm is more significant in transport orders with high time weight. With the increase in uncertainty, the reliability of the route decreases. The effectiveness of the proposed method is verified.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
×
引用
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学术官方微信