nav emailalert searchbtn searchbox tablepage yinyongbenwen piczone journalimg journalInfo journalinfonormal searchdiv searchzone qikanlogo popupnotification paper paperNew
2012, 04, v.10;No.38 19-25
满足交通网络流量增长态势的扩能优化研究
基金项目(Foundation):
邮箱(Email):
DOI:
摘要:

在交通网络的实际应用中,流量的发展态势往往超出现存网络的最大流量承载能力,这就需要考虑如何提高网络的输送能力,即如何对交通网络进行扩能。本文基于发展态势的流量需求、扩能代价最低以及扩能拥堵程度高的线路条件,构造了最优的扩能算法。通过此算法,可以选择交通网络中最优的扩能路线。在交通运输领域,由于流量的发展态势需要扩能的问题普遍存在,本文的研究内容可以为交通网络的扩能决策、优化、设计等提供应用基础。

Abstract:

In the practical traffic network,the increscent flow is likely over the maximal network capacity,so it is necessary to enhance the transportation capacity of the traffic network,namely,to enlarge the capacity.In this article,based on the state of the increscent flow and the lowest cost enlarging the capacity and to enlarge the capacity of the more congested route,an optimization algorithm on enlarging the capacity of traffic network was devised.Utilizing this optimization algorithm,the optimized enlarging capacity could be found.In traffic and transportation field,it is ubiquitous to enhance the transportation capacity due to the state of the increscent flow,this research can likely offer an applied method for decision-making,optimization and design of traffic network.

KeyWords:
参考文献

[1]甘爱英等.运筹学[M].北京:清华大学出版社,2002.

[2]焦永兰.管理运筹学[M].北京:中国铁道出版社,2005.

[3]藤传琳.管理运筹学[M].北京:中国铁道出版社,1986.

[4]宁宣熙.堵塞流理论[M].北京:科学出版社,2005.

[5]凌永发,陈国良,李正明.网络最大流问题典型组合算法研究[J].云南民族大学学报,2006,15(3):211-214.

[6]Dinic E.A.Algorithm for solution of a problem of maximum flow in networks with power estimation[J].Soviet Math Dokl,1970,11(8):1277-1280.

[7]冯成仅.稀疏网络的最短路算法[J].运筹学,1991,(12):77-78.

[8]叶清,郁振伟.改进最短路径算法在最佳航线选择中的应用[J].中国航海,2003(2):15-17.

[9]Rahuja Avindra K.,Magnanti Thomas L,Orlin James B.Network flows:theory,algorithms,and applications[M].New Jersey,Princeton,Prentice-Hall,1993:46-210.

[10]NI Daiheng.Determining traffic flow characteristics by definition for application in ITS[J].Ieee Transactions on Intelligent Transportation Systems,2007,8(2):181-187.

[11]GOLDBERG A.V,RAOS.Flows in undirected unit capacity networks[J].Siam Journal on DiscreteMathematics,1999,12(1):1-5.

[12]徐周波,古天龙,赵岭忠.网络最大流问题求解的符号ADD增广路径算法[J].计算机科学,2005,32(10):38-54.

[13]Hachtel G.D.,Somenzi F.A symbolic algorithm for maximum flow in0-1networks[J].Formal Methods in System Design,1997,10(2-3):207-219.

[14]Irisbahar R.,Erica A.Frohm,Charles M.Gaona.Algebraic decision diagrams and their applications[J].Formal Methods in Systems Design,1997,10:171-206.

[15]Goldberg A.V.Recent developments in maximum flow algorithms[A].Proceedings of the6th Scandinavian Workshop on Algorithm Theory,Stockholm,Lecture Notes in Computer Science[C].1998,1432(1):1-10.

基本信息:

中图分类号:U491.112

引用信息:

[1]寇玮华,崔皓莹.满足交通网络流量增长态势的扩能优化研究[J],2012,10(04):19-25.

检 索 高级检索

引用

GB/T 7714-2015 格式引文
MLA格式引文
APA格式引文