基于综合运输网络的客流分配优化模型与算法  

Optimization Model and Algorithm of Passenger Flow Assignment Based on Comprehensive Transportation Network

作　　者：宋亚萍[1] 王瑞军[1] 李会玲[1] 胡思继[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《中国铁道科学》2011年第5期127-131,共5页China Railway Science

基　　金：美国能源基金会资助项目(G-0910-11572)

摘　　要：以综合运输网络条件下的客流分配为研究对象,提出更适合表现旅客出行需求和各种运输方式相互竞争关系的运输细分方式,采用可量化表征综合运输网络当前客流状态的区间饱和度和径路饱和熵,并结合旅客出行广义费用函数,构造旅客出行阻抗函数,给出以综合运输网络中旅客出行总阻抗最小为目标的客流分配优化模型。基于k条最短路算法和混沌优化算法,在径路选择时考虑当前综合运输网络的旅客出行阻抗因素,设计客流分配迭代优化的动态求解算法。算例表明,利用给出的模型和算法能够得到可行和更为细分的综合运输网络客流分配方案。To make the passenger flow assignment under the condition of comprehensive transportation network as the research object,this paper puts forward the concept of transportation subdivision way which is more suitable to performance passenger travel demand and competition between different transport modes,and the concepts of sector saturation and route saturated entropy to quantitatively characterize passenger flow status of current comprehensive transportation network.In association with the generalized cost function of passenger travel,the impedance function of passenger travel is constructed and the optimization model of passenger flow assignment is proposed with the target of the minimum total passenger travel impedance in the comprehensive transportation network.Based on the kth shortest path algorithm and chaos optimization algorithm,as well as considering the factor of passenger travel impedance for routing under current comprehensive transportation network,the dynamic solution algorithm of iterative optimization for passenger flow assignment is designed.Calculation example shows that the given model and algorithm can produce feasible and more subdivided passenger flow assignment schemes under the condition of comprehensive transportation network.

关 键 词：综合运输网络 客流分配 旅客出行阻抗 k条最短路算法 混沌优化算法 

分 类 号：U113[交通运输工程] U116.3