交通运输系统工程与信息
交通運輸繫統工程與信息
교통운수계통공정여신식
JOURNAL OF COMMUNICATION AND TRANSPORTATION SYSTEMS ENGINEERING AND INFORMATION
2014年
4期
139-145
,共7页
城市交通%随机用户平衡%相继平均法%广义巢式Logit%多用户%多准则
城市交通%隨機用戶平衡%相繼平均法%廣義巢式Logit%多用戶%多準則
성시교통%수궤용호평형%상계평균법%엄의소식Logit%다용호%다준칙
urban traffic%SUE%MSA%generalized nested Logit%multi-class%multi-criteria
介绍了广义巢式Logit的基本理论,在此基础上,考虑具有不同时间价值的多种用户类别出行者,构造了基于广义巢式Logit的多用户多准则随机用户平衡的等价数学规划模型,并对该模型的等价性和唯一性进行了证明。设计了求解所提出的随机用户平衡模型的基于路径的相继平均法,通过一个算例验证了所设计算法的有效性。分析了分散系数变化对交通分配结果的影响,最后与多项式Logit的分配结果进行对比。算例结果表明,本文所提出的模型能够克服多项式Logit模型的IIA特性,设计的算法具有较高的求解效率。
介紹瞭廣義巢式Logit的基本理論,在此基礎上,攷慮具有不同時間價值的多種用戶類彆齣行者,構造瞭基于廣義巢式Logit的多用戶多準則隨機用戶平衡的等價數學規劃模型,併對該模型的等價性和唯一性進行瞭證明。設計瞭求解所提齣的隨機用戶平衡模型的基于路徑的相繼平均法,通過一箇算例驗證瞭所設計算法的有效性。分析瞭分散繫數變化對交通分配結果的影響,最後與多項式Logit的分配結果進行對比。算例結果錶明,本文所提齣的模型能夠剋服多項式Logit模型的IIA特性,設計的算法具有較高的求解效率。
개소료엄의소식Logit적기본이론,재차기출상,고필구유불동시간개치적다충용호유별출행자,구조료기우엄의소식Logit적다용호다준칙수궤용호평형적등개수학규화모형,병대해모형적등개성화유일성진행료증명。설계료구해소제출적수궤용호평형모형적기우로경적상계평균법,통과일개산례험증료소설계산법적유효성。분석료분산계수변화대교통분배결과적영향,최후여다항식Logit적분배결과진행대비。산례결과표명,본문소제출적모형능구극복다항식Logit모형적IIA특성,설계적산법구유교고적구해효솔。
This paper focuses on the multi-class, multi-criteria stochastic user equilibrium model based on the generalized nested logit model. The basic theory of generalized nested Logit model is introduced and the multi-class users with different value of times are considered. Then the equivalent mathematical program-ming model for the multi-class, multi-criteria stochastic user equilibrium model based on the generalized nested Logit model is set up and the equivalence and uniqueness conditions are proved. The path-based meth-od of successive averages (MSA) algorithm is designed to solve the proposed mathematical programming model and the effectiveness of the proposed algorithm is verified in a numerical example. The influences of dispersion parameter with different values on the traffic assignment results are analyzed and the assignment result is compared with that of MNL model. The results of the numerical example show that the proposed model can overcome the IIA property of the MNL model and the proposed algorithm has high efficiency.