期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Route optimization model for pedestrian evacuation in metro hubs 被引量:2
1
作者 任刚 赵星 李岩 《Journal of Central South University》 SCIE EI CAS 2014年第2期822-831,共10页
The route optimization problem for road networks was applied to pedestrian flow.Evacuation path networks with nodes and arcs considering the traffic capacities of facilities were built in metro hubs,and a path impedan... The route optimization problem for road networks was applied to pedestrian flow.Evacuation path networks with nodes and arcs considering the traffic capacities of facilities were built in metro hubs,and a path impedance function for metro hubs which used the relationships among circulation speed,density and flow rate for pedestrians was defined.Then,a route optimization model which minimizes the movement time of the last evacuee was constructed to optimize evacuation performance.Solutions to the proposed mathematical model were obtained through an iterative optimization process.The route optimization model was applied to Xidan Station of Beijing Metro Line 4 based on the actual situations,and the calculation results of the model were tested using buildingExodus microscopic evacuation simulation software.The simulation result shows that the proposed model shortens the evacuation time by 16.05%,3.15% and 2.78% compared with all or none method,equally split method and Logit model,respectively.Furthermore,when the population gets larger,evacuation efficiency in the proposed model has a greater advantage. 展开更多
关键词 route optimization problem path impedance evacuation pedestrian flow metro hub
下载PDF
0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM
2
作者 堵丁柱 KER-IKo 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1989年第1期68-80,共13页
A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Lin... A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Links of the same feature have the same cost. It is proved that the problem of finding ?routing tree of the minimum cost for a given set of tasks of two features is NP-complete. 展开更多
关键词 NODE TH THE COMPLEXITY OF AN OPTIMAL ROUTING TREE problem
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部