Optimization of Coal Transportation Path Based on Dijkstra and Genetic-Simulated Annealing Algorithm

Junqi Liang, X. He
{"title":"Optimization of Coal Transportation Path Based on Dijkstra and Genetic-Simulated Annealing Algorithm","authors":"Junqi Liang, X. He","doi":"10.1109/ISTTCA53489.2021.9654434","DOIUrl":null,"url":null,"abstract":"This paper explores the issue of emergency transportation routes for coal. The main factors influencing the transportation of coal are taken into account, including transport time, transport costs, and the additional time and costs required for transit transport. The two primary modes of transport for coal are road transport and rail transport, considering unfavorable factors such as the excessive time consumed by waterway transport. In this paper, a coal emergency transport path optimization model is constructed. Moreover, this paper applies a hybrid algorithm of Dijkstra and genetic-simulated annealing to solve the coal transport path model, with minimum time and minimum cost as the objective function. A few transport routes with short paths are initially obtained by Dijkstra's algorithm, and these routes are used as input paths for the genetic-simulated annealing algorithm. Based on this hybrid algorithm, the optimal combination of transport modes is generated by combining population crossover and mutation. The hybrid algorithm can find the exact transport method relatively quickly.","PeriodicalId":383266,"journal":{"name":"2021 4th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTTCA53489.2021.9654434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper explores the issue of emergency transportation routes for coal. The main factors influencing the transportation of coal are taken into account, including transport time, transport costs, and the additional time and costs required for transit transport. The two primary modes of transport for coal are road transport and rail transport, considering unfavorable factors such as the excessive time consumed by waterway transport. In this paper, a coal emergency transport path optimization model is constructed. Moreover, this paper applies a hybrid algorithm of Dijkstra and genetic-simulated annealing to solve the coal transport path model, with minimum time and minimum cost as the objective function. A few transport routes with short paths are initially obtained by Dijkstra's algorithm, and these routes are used as input paths for the genetic-simulated annealing algorithm. Based on this hybrid algorithm, the optimal combination of transport modes is generated by combining population crossover and mutation. The hybrid algorithm can find the exact transport method relatively quickly.
基于Dijkstra和遗传模拟退火算法的煤炭运输路径优化
本文探讨了煤炭应急运输路线问题。考虑了影响煤炭运输的主要因素,包括运输时间、运输成本以及中转运输所需的额外时间和成本。考虑到水路运输时间过长等不利因素,煤炭的两种主要运输方式是公路运输和铁路运输。本文建立了煤炭应急运输路径优化模型。以时间和成本最小为目标函数,采用Dijkstra和遗传模拟退火混合算法求解煤炭运输路径模型。通过Dijkstra算法初步得到了一些路径较短的传输路径,并将这些路径作为遗传模拟退火算法的输入路径。在该混合算法的基础上,通过种群交叉和种群突变相结合,生成了最优的运输方式组合。混合算法可以较快地找到准确的传输方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信