首页 | 本学科首页   官方微博 | 高级检索  
     检索      

混合交通网络设计问题的迭代降维算法(英文)
引用本文:陈群,姚加林.混合交通网络设计问题的迭代降维算法(英文)[J].东南大学学报,2012(2):236-239.
作者姓名:陈群  姚加林
作者单位:中南大学交通运输工程学院
基金项目:The National Natural Science Foundation of China(No. 50908235 );China Postdoctoral Science Foundation (No.201003520)
摘    要:提出了一种优化的迭代降维算法求解混合交通网络设计问题. 混合(连续/离散) 交通网络设计问题常表示为一个带均衡约束的数学规划问题,上层通过新建路段和改善已有路段来优化网络性能,下层是一个传统的 Wardrop 用户均衡模型. 迭代降维算法的基本思想是降维,先保持一组变量(离散/连续) 不变,交替地对另一组变量(连续/离散) 实现最优化. 以迭代的形式反复求解连续网络设计和离散网络设计问题,直至最后收敛到最优解. 通过一个数值算例对算法的效果进行了验证.

关 键 词:混合网络设计问题  迭代降维算法  带均衡约束数学规划

Dimension-down iterative algorithm for the mixed transportation network design problem
Chen Qun Yao Jialin.Dimension-down iterative algorithm for the mixed transportation network design problem[J].Journal of Southeast University(English Edition),2012(2):236-239.
Authors:Chen Qun Yao Jialin
Institution:Chen Qun Yao Jialin(School of Traffic and Transportation Engineering,Central South University,Changsha 410075,China)
Abstract:An optimal dimension-down iterative algorithm(DDIA) is proposed for solving a mixed(continuous/discrete) transportation network design problem(MNDP),which is generally expressed as a mathematical programming with equilibrium constraints(MPEC).The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links,whereas the lower level is a traditional Wardrop user equilibrium(UE) model.The idea of the proposed DDIA is to reduce the dimensions of the problem.A group of variables(discrete/continuous) are fixed to alternately optimize another group of variables(continuous/discrete).Some continuous network design problems(CNDPs) and discrete network design problems(DNDPs) are solved repeatedly until the optimal solution is obtained.A numerical example is given to demonstrate the efficiency of the proposed algorithm.
Keywords:mixed network design problem(MNDP)  dimension-down iterative algorithm(DDIA)  mathematical programming with equilibrium constraint(MPEC)
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号