基于FAST-ICA的城市轨道交通乘客路径选择方法

doi:10.16182/j.issn1004731x.joss.17-0267

系统仿真学报 ›› 2019, Vol. 31 ›› Issue (8): 1692-1701.doi: 10.16182/j.issn1004731x.joss.17-0267

基于FAST-ICA的城市轨道交通乘客路径选择方法

连晓峰¹, 叶璐¹, 王炎¹, 贾利民², 马慧茹²

1. 北京工商大学计算机与信息工程学院,北京 100048;
2. 轨道交通控制与安全国家重点实验室(北京交通大学),北京100044

收稿日期:2017-06-06 修回日期:2017-07-28 发布日期:2019-12-12
作者简介:连晓峰(1977-),男,山西长治,博士生,副教授,研究方向为智能控制与模式识别。
基金资助:
国家自然科学基金(61702020),北京市自然科学基金(4172013),北京市自然科学基金-海淀原始创新联合基金(L182007)

Research on Urban Rail Transit Route Choice Decision Based on the Improved Imperialist Competition Algorithm

Lian Xiaofeng¹, Ye Lu¹, Wang Yan¹, Jia Limin², Ma Huiru²

1. School of Computer and Information Engineering, Beijing Technology and Business University, Beijing 100048, China;
2. State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China

Received:2017-06-06 Revised:2017-07-28 Published:2019-12-12

摘要/Abstract

摘要： 提出一种基于改进帝国主义竞争算法(FAST-ICA)的城市轨道交通乘客路径选择方法,以提高乘客路径选择的效率。选取6种影响乘客路径选择的关键因素,在此基础上,构建广义出行费用函数,并建立乘客路径选择模型;通过改进帝国主义竞争算法(ICA)中的帝国竞争方式,在ICA算法的每次迭代中快速瓜分最弱帝国集团,以加快收敛速度;基于所提出的FAST-ICA算法求解乘客在不同环境下的路径选择问题,并进行深入分析。实验结果表明,FAST-ICA算法具有良好的稳定性,且收敛速度较快。

关键词: 城市轨道交通, 关键影响因素选取, 路径选择模型, 快速帝国主义竞争算法

Abstract: This paper proposes a method of passenger route selection based on the imperialist competition improvement algorithm (FAST-ICA) to improve the efficiency of passenger route selection. Six key factors influencing the choice of passenger route are selected. On this basis, the generalized travel cost function is constructed and the passenger route selection model is established. By improving the imperial competition way in the imperialist competition algorithm (ICA), the weakest imperial groups are quickly divided up in each iteration of ICA algorithm to accelerate the convergence rate. Based on the proposed FAST-ICA algorithm, the problem of passenger choice in different environments is solved and carried out in-depth analysis. The experimental results show that the FAST ICA algorithm has good stability and fast convergence speed.

Key words: urban rail transit, key influencing factors selection, path selection model, fast imperialist competition algorithm

中图分类号:

TP391.9

连晓峰, 叶璐, 王炎, 贾利民, 马慧茹. 基于FAST-ICA的城市轨道交通乘客路径选择方法[J]. 系统仿真学报, 2019, 31(8): 1692-1701.

Lian Xiaofeng, Ye Lu, Wang Yan, Jia Limin, Ma Huiru. Research on Urban Rail Transit Route Choice Decision Based on the Improved Imperialist Competition Algorithm[J]. Journal of System Simulation, 2019, 31(8): 1692-1701.

参考文献

[1] 乔珂, 赵鹏, 秦志鹏. 基于乘客类别的轨道交通网络乘客路径选择[J]. 北京交通大学学报, 2012, 36(6): 102-106.
Qiao Ke, Zhao Peng, Qin Zhipeng.Passenger route selection based on passenger class[J]. Journal of Beijing Jiaotong University, 2012, 36(6): 102-106.
[2] Raveau S, Munoz J C, De Grange L.A topological route choice model for metro[J]. Transportation Research Part A: Policy and Practice (S0965-8564), 2011, 45(2): 138-147.
[3] 高国飞. 基于MNL的轨道交通乘客路径选择问题研究[D]. 北京: 北京交通大学, 2009.
Gao Guofei.Study on Passenger Route Selection of Rail Transit Based on MNL[D]. Beijing: Beijing Jiaotong University, 2009.
[4] Jason Brownlee.Clever Algorithms: Nature-Inspired Programming Recipes[M]. LuLu Publish. 2011.
[5] 刘坤. 基于蚁群算法的轨道交通路径选择模型及应用研究[D]. 北京: 北京交通大学, 2016.
Liu Kun.Based on the ant colony algorithm of rail transit path selection model and its application[D]. Beijing: Beijing Jiaotong University, 2016.
[6] 刘剑锋, 孙福亮, 柏赞, 等. 城市轨道交通乘客路径选择模型及算法[J]. 交通运输系统工程与信息, 2009, 9(2): 81-86.
Liu Jianfeng, Sun Fuliang, Bai Zan, et al.Model and algorithm of passenger routing for urban rail transit[J]. Journal of Transportation Systems Engineering and Information, 2009, 9(2): 81-86.
[7] 四兵峰, 毛保华, 刘智丽. 无缝换乘条件下城市轨道交通网络客流分配模型及算法[J]. 铁路学报, 2007, 29(6): 12-18.
Si Bingfeng, Mao Baohua, Liu Zhili.Model and algorithm of passenger flow distribution in urban rail transit network under seamless transfer[J]. Journal of Beijing University of Railways, 2007, 29(6): 12-18.
[8] Esmaeil Atashpaz-Gargari, Caro Lucas.Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition[C]. IEEE Congress on Evolutionary Computation, Singapore, 2007: 4661-4667.
[9] S Nazari-Shirkouhi, H Eivazy, R Ghodsi, et al.Solving the Integrated Product Mix-Outsourcing Problem by a Novel Meta-Heuristic Algorithm: Imperialist Competitive Algorithm[J]. Expert Systems with Applications (S0957-4174), 2010, 37(12): 7615-7626.
[10] 郝岩. 基于帝国竞争算法的非概率可靠性分析及优化[D]. 长春: 吉林大学, 2014.
Hao Yan.Non probabilistic reliability analysis and Optimization Based on imperial competition algorithm [D]. Changchun: Jilin University, 2014.
[11] 王晓光, 赵春燕, 李群. 基于帝国主义竞争算法的WSNs定位方案[J]. 传感器与微系统, 2014, 32(1): 42-48.
Wang Xiaoguang, Zhao ChunYan, Li Qun. WSNs positioning scheme based on imperialist competition algorithm[J]. Sensor and Microsystem, 2014, 32(1): 42-48.
[12] D P Acharya, G Panda, Y V S Lakshmi. Effects of ﬁnite register length on fast ICA, bacterial foraging optimization based ICA and constrained genetic algorithm based ICA algorithm[J]. Digital Signal Processing (S1051-2004), 2010, 20(3): 964-975.
[13] Taher Niknam, Elahe Taherian Fard, Shervin Ehrampoosh, et al.A new hybrid imperialist competitive algorithm on data clustering[J]. Sadhana (S0973-7677), 2011, 36(3): 293-315.
[14] S Talatahari, B Farahmand Azar, R Sheikholeslami, et al.Imperialist competitive algorithm combined with chaos for global optimization[J]. Communications in Nonlinear Science and Numerical Simulation (S1007-5704), 2012, 17(3): 1312-1319.
[15] S Moadi, A S Mohaymany, M Babaei.Application of imperialist competitive algorithm to the emergency medical services location problem[J]. International Journal of Artiﬁcial Intelligence and Applications (IJAIA)(S2333-9721), 2011, 2(4): 137-147.
[16] M Bagher, M Zandieh, H Farsijani.Balancing of stochastic U-type assembly lines: An imperialist competitive algorithm[J]. International Journal of Advanced Manufacturing Technology (S1433-3015), 2011, 54: 271-285.
[17] Ghanavati, Gholamian, Minaei, et al. An efﬁcient cost function for imperialist competitive algorithm to ﬁnd best clusters[J]. Journal of Theoretical and Applied Information Technology (S1992-8645), 2011, 29: 22-31.
[18] M Mohammadi, R Tavakkoli-Moghaddam, H Rostami.A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem[J]. International Journal of Industrial Engineering Computations (S1923-2926), 2011, 2: 671-688.
[19] H C Nejad, R Jahani.A new approach to economic load dispatch of power system using imperialist competitive algorithm[J]. Australian Journal of Basic and Applied Sciences (S1991-8178), 2011, 5: 835-843.
[20] S Forouharfard, Mostafa Zandieh. An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems[J]. International Journal of Advanced Manufacturing Technology (S0268-3768), 2010, 51(9): 1179-1193.

基于FAST-ICA的城市轨道交通乘客路径选择方法

Research on Urban Rail Transit Route Choice Decision Based on the Improved Imperialist Competition Algorithm

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价

[1]	刘枫, 邵春福, 贾洪飞, 董春娇. 城轨换乘站服务设施布局与流线优化仿真评价[J]. 系统仿真学报, 2021, 33(7): 1670-1681.
[2]	李晓赫, 吴建平, 彭德品. 城轨站点高峰小时客流预测控制方法[J]. 系统仿真学报, 2021, 33(12): 2952-2958.
[3]	杜恒, 郜春海, 黄勍, 仓怀明. 城市轨道交通全自动运行系统仿真研究及应用[J]. 系统仿真学报, 2020, 32(2): 157-163.
[4]	唐克双, 张桁嘉, 衣谢博闻. 基于多智能体仿真的交通诱导系统效率评价[J]. 系统仿真学报, 2018, 30(7): 2630-2639.
[5]	刘炜, 许嘉轩, 王沛沛, 刘瑞龙, 唐靖坤. 基于模拟退火算法的列车节能操纵研究[J]. 系统仿真学报, 2018, 30(6): 2320-2327.
[6]	蒋阳升, 朱娟秀, 胡路, 韩世凡. 地铁楼梯宽度的排队系统仿真优化[J]. 系统仿真学报, 2016, 28(1): 129-138.