期刊文献+

混合交通网络设计及免疫克隆退火算法求解研究 被引量:3

Mixed Transportation Network Design Based on Immune Clone Annealing Algorithm
在线阅读 下载PDF
导出
摘要 研究混合交通网络设计问题,以交通网络总阻抗最小为目标,在建设资金的约束条件下给出了双层规划模型.将模拟退火算法中的退火策略引入到免疫克隆算法中,设计了求解模型的免疫克隆退火算法.算例验证了算法的可行性,并通过与模拟退火算法比较证明了设计算法的有效性.最后,在给定不同建设资金的约束条件下进行了灵敏度分析,并讨论了投资成本与网络总阻抗、建设资金约束与网络设计决策的关系. This paper focuses on the mixed transportation network design problem. A bi-level programming model, constrained by investment budget, is developed to minimize the total impedance of transportation network. The immune clone annealing algorithm, which is designed by combining annealing tactic of simulated annealing algorithm and immune clone algorithm, is introduced to solve the proposed bi-level model. Compared with simulated annealing algorithm, the feasibility and effectiveness of the model and the algorithm is demonstrated through a numerical experiment. The sensitivity analysis on different investment budget constraints is provided, as well as the relation between investment cost and the total impedance of network, investment budget constraint, and decision on network design.
出处 《交通运输系统工程与信息》 EI CSCD 2009年第3期103-108,共6页 Journal of Transportation Systems Engineering and Information Technology
基金 "863"国家高科技项目(2006AA11Z203 2007AA11Z208) 霍英东基金(104007) 北京交通大学重点基金项目(2006XZ004)
关键词 混合交通网络设计 双层规划 资金约束 免疫克隆算法 模拟退火算法 免疫克隆退火算法 mixed transportation network design bi-level programming financial constraint immune clone algorithm simulated annealing algorithm immune clone annealing algorithm
  • 相关文献

参考文献6

二级参考文献22

  • 1周和平,晏克非,徐汝华,文雅.基于遗传算法的公路网络设计的双层优化模型[J].同济大学学报(自然科学版),2005,33(7):920-925. 被引量:19
  • 2黄海军.城市交通网络平衡分析理论与方法[M].北京:人民交通出版社,1994..
  • 3《运筹学》教材编写组.运筹学[M].北京:清华大学出版社,1998.254-309.
  • 4王维工,浦再明.加速长江三角洲经济一体化发展的战略构想[N].解放日报,2003-1-20.
  • 5玄光男 程润伟.遗传算法与工程优化[M].北京:清华大学出版社,2004..
  • 6P J Bentley,J P Wakefield.Overview of Generic Evolutionary Design Systems[EB/OL].Proceedings of the 2nd On-Line World Conference on Evolutionary Computation ( WEC2 ).http://wwwbioele.nuee.nagoya-u.ac.jp/WEC2/,1996-05-5/1996-05-22.
  • 7D B Fogel,J W Atmar.Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems[J].Biological Cybernetics,1993,63:111-114.
  • 8H P Schwefel.Evolutionary Optimum Seeking[M].New York:John Wiley&Son,1995.
  • 9A Dekkers,E Aarts.Global optimization and simulated annealing[ J].Math Programming,1991,50:367-393.
  • 10LeBlanc L J. An algorithm for discrete network design problems[J]. Transportation, 1975, (9):183-199

共引文献150

同被引文献35

  • 1董敬欣,吴建平.基于神经网络的交通平衡求解算法[J].系统仿真学报,2005,17(6):1380-1383. 被引量:4
  • 2张国强,陆键.连续网络设计问题的遗传算法[J].交通运输系统工程与信息,2007,7(1):101-105. 被引量:4
  • 3Claudine Sproles.Trends in sustainable development[J].Government Information Quarterly,2008,25(2):337-338.
  • 4Chiou S W.Bilevel programming for the continuous transport network design[J].Transportation Research Part B,2005,39:361-383.
  • 5Jeff X,Ban,Henry X,et al.A general MPCC model and its solution algorithm for continuous network design problem[J].Mathematical and Computer Modelling,2006,43(5-6):493-505.
  • 6Tianze Xu,Heng Wei,Zhuan-De Wang.Study on continuous network design problem using simulated annealing and genetic algorithm[J].Expert Systems with Applications,2009,36(2):2735-2741.
  • 7Hossain Poorzahedy,Mark A Turnquist.Approximate algorithms for the discrete network design problem[J].Transportation Research Part B,1982,16(1):45-55.
  • 8Gao Z Y,Wu J J,Sun H J.Solution algorithm for the bi-level discrete network design problem[J].Transportation Research Part B,2005,39:479-495.
  • 9Yin Y,Lawphongpanich S.Internalizing emission externality on road networks[J].Transportation Research Part D,2006,11:292-301.
  • 10Jayakrishnan R,TsaiW K,ParashkerJ N,et al.Faster path based algorithm for traffic assignment.Transportation Research Record,Washington D C,TRB National Research Council,1994:75-83.

引证文献3

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部