Multimodal network path optimization based on a two‐stage algorithm in the perspective of sustainable transport development

透视图(图形) 阶段(地层学) 路径(计算) 多式联运 可持续发展 计算机科学 开发(拓扑) 算法 人工智能 数学优化 数学 工程类 计算机网络 运输工程 地质学 生物 生态学 古生物学 数学分析
作者
Qiao Cong,Ke Niu,Weina Ma
出处
期刊:Advanced control for applications [Wiley]
卷期号:6 (4)
标识
DOI:10.1002/adc2.187
摘要

Abstract The environmental issues brought on by carbon emissions from transport have risen to prominence in recent years. More and more academics are using the multi‐objective path optimization method to solve the multimodal optimization problem from the standpoint of sustainable development in order to address the environmental issues brought on by the transport process. The research proposes a two‐stage method to handle multi‐objective optimization convergence and simplify multimodal transport path optimization. In the first stage, a fuzzy C clustering model is established, and based on the clustering results, the multimodal transport network nodes are identified. In the second stage, a multimodal transport multi‐objective path optimization model is established, and the optimal path is solved using a genetic algorithm. The research method was applied in the Bohai Rim region. Results indicated that the fuzzy C‐clustering method and the genetic method were able to select the optimal node city, thus solving the actual site selection problem of multimodal transportation networks. Using the FCM model, the 86 city nodes were categorized into four types, leading to the establishment of the most proficient multimodal transportation network in the Bohai Rim region. Using a genetic algorithm for optimization, a stable state is reached after 25 iterations. In the validation experiment on path optimization, the cost was reduced by 47.12% compared to the minimum single objective time, and transportation carbon emissions saw a reduction of 28.23%. Similarly, compared to the lowest target for transportation carbon emissions, the cost was reduced by 39.48% and the time was reduced by 38.12%. Compared to the lowest target for transportation carbon emissions, the time was reduced by 32.02% and the carbon emissions were reduced by 19.23%. Notably, the transportation multi‐objective path optimization model showed significant improvement compared to the single‐target model. The research method has been proven to be superior, and can offer the most optimal transportation route guidance for participants in multimodal transportation. Furthermore, it can effectively tackle the issue of node selection convergence and multi‐objective optimization, while also serving as a valuable source of data to support the theoretical advancement of multimodal transportation network path optimization.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
sian完成签到,获得积分10
1秒前
阮文名完成签到,获得积分10
1秒前
陈平安发布了新的文献求助10
1秒前
ymh完成签到,获得积分10
2秒前
JamesPei应助高高的电源采纳,获得10
2秒前
Nicole发布了新的文献求助10
2秒前
TT发布了新的文献求助10
3秒前
可耐的尔烟完成签到,获得积分20
4秒前
尼斯湖水怪完成签到,获得积分20
7秒前
8秒前
初景发布了新的文献求助10
9秒前
想吃见手青完成签到 ,获得积分10
10秒前
10秒前
白nb66完成签到 ,获得积分10
10秒前
10秒前
10秒前
稳重的冥王星完成签到 ,获得积分10
11秒前
老迟到的沉鱼完成签到,获得积分20
11秒前
liuchang完成签到 ,获得积分10
12秒前
沉梦昂志_hzy完成签到,获得积分0
12秒前
12秒前
12秒前
爱听歌的半凡完成签到,获得积分10
13秒前
15秒前
Homura发布了新的文献求助10
15秒前
Yi完成签到,获得积分10
16秒前
16秒前
纳纳椰发布了新的文献求助10
17秒前
立里发布了新的文献求助10
18秒前
18秒前
CFD应助Nicole采纳,获得10
20秒前
等待完成签到 ,获得积分10
20秒前
无花果应助lion_wei采纳,获得10
20秒前
21秒前
23秒前
上官若男应助双枪林黛玉采纳,获得10
24秒前
24秒前
夏渃浠发布了新的文献求助10
24秒前
西哥完成签到,获得积分10
27秒前
醉熏的梦松完成签到 ,获得积分10
27秒前
高分求助中
液晶指向矢仿真分析数据集 8888
Invited Discussant 63O and 64O 1000
Ideology and Meaning-Making under the Putin Regime 750
Thermal effects on behaviour of clay–structure interface under partial drainage 500
Petrology and Plate Tectonics 500
Writing Systems 500
A Handbook of User Experience Research & Design in Libraries 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 计算机科学 化学工程 生物化学 物理 内科学 复合材料 催化作用 光电子学 物理化学 电极 细胞生物学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6896242
求助须知:如何正确求助?哪些是违规求助? 8591966
关于积分的说明 18243694
捐赠科研通 6292556
什么是DOI,文献DOI怎么找? 3060621
关于科研通互助平台的介绍 2079316
邀请新用户注册赠送积分活动 2038417