改进粒子群算法的行人设施客流适应度博弈分析  

Game Analysis on Adaptability of Pedestrian Facilities in Transit Hubs Based on Modified PSO

作　　者：王力[1] 王立根[1] 张海波[1] 李正熙[1] 

机构地区：[1]北方工业大学机电工程学院,北京100041

出　　处：《都市快轨交通》2015年第3期34-38,共5页Urban Rapid Rail Transit

基　　金：国家"863"高技术研究发展计划资助项目(2012AA112401);北京市科委计划项目(PXM2014_014212_000020;PXM2014_014212_000053;PXM2014_014212_000032)

摘　　要：为了有效改善交通枢纽内部行人设施的运行状况,提出交通枢纽行人设施客流适应度的概念,以此对交通枢纽的服务水平进行量化分析。同时,将粒子群算法进行改进,并应用于行人设施客流适应度的博弈分析。各行人设施对应粒子的每一维参与博弈,通过粒子位置的更新实现参与博弈的行人设施控制参数的更新,经过博弈迭代搜索到交通枢纽行人设施客流适应度的最优值及对应的各行人设施的控制参数。仿真实例表明:该方法对实际交通枢纽中行人设施的组织优化具有一定的应用价值。In order to improve the operational condition of pedestrian facilities ha transit hubs effectively, this paper proposes the concept of Adaptability of Pedestrian Facilities which can be used to analyze the service level ha a transit hub quantitatively. Also, particle swarm optimization （PSO） is modified to be applied ha game analysis of Adaptability of Pedestrian Facilities. Each pedestrian facility corresponds to each dimension of particles and is havolved ha the game. By updathag particles＇ position, the control parameters of pedestrian facilities involved ha the game are also updated. The optimal adaptabilities of pedestrian facilities ha a transit hub and the corresponding control parameters can be acquired through iterative searching. The simulation result shows that the proposed method is of some application value to optimize and organize pedestrian facilities ha actual transit hubs.

关 键 词：城市交通 客流适应度 粒子群算法 博弈分析 行人设施 

分 类 号：U492.141[交通运输工程—交通运输规划与管理]