检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘文龙 张晶[1] 周绥平 李月龙[1] LIU Wen-long;ZHANG Jing;ZHOU Sui-ping;LI Yue-long(School of Computer Science and Software,Tianjin Polytechnic University,Tianjin 300387,China;School of Science and Technology,Middlesex University,London NW4 4BT,United Kingdom)
机构地区:[1]天津工业大学计算机科学与软件学院,天津300387 [2]密德萨斯大学科学与技术学院
出 处:《计算机科学》2018年第12期187-191,共5页Computer Science
基 金:中国博士后科学基金(2015M570228)资助
摘 要:针对地铁乘客人群的运动行为,基于Agent模型和粒子群搜索算法,利用仿真平台Repast Simphony建立了人群运动行为仿真模型,该模型模拟了乘客进入地铁候车大厅寻找车厢门进行排队和地铁到站时进入车厢的过程;基于此,提出了一种基于马尔可夫决策模型的改进寻路算法。实验表明,该算法有效地解决了传统粒子群算法容易陷入局部解的问题,明显减少了冲突次数。此外,文中提出增加地铁车厢人数指示器来避免部分车厢的拥挤状况,实验结果显示该方法行之有效,并能将乘客进入车厢的效率提高9%。Aiming at the movement behaviors of subway passengers,based on the Agent model and the particle swarm algorithm,through utilizing the simulation platform of Repast Simphony,this paper built a simulation model of crowd movement behavior.The model simulates the process of passengers entering the waiting room of subway station,then looking for subway’s door for queuing,and entering the subway when subway arrives at station.On this basis,this paper proposed an improved routing algorithm based on Markov decision model.Experimental results show that this algorithm can effectively solve the problem that traditional particle swarm algorithm is easy to trap in local solution,and significantly reduce the number of collisions.In addition,this paper proposed a method to avoid congestion in some compartments through employing passenger number indicator of subway compartment.Experimental results show that this method is effective and can improve the efficiency of passengers entering the compartment by 9%.
关 键 词:REPAST Simphony 排队 建模 仿真 粒子群 马尔可夫
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33