非平衡交通分配的离散网络平衡设计模型与算法 |
| |
引用本文: | 肖海燕,王先甲,黄崇超. 非平衡交通分配的离散网络平衡设计模型与算法[J]. 武汉大学学报(工学版), 2009, 42(6) |
| |
作者姓名: | 肖海燕 王先甲 黄崇超 |
| |
作者单位: | 1. 武汉大学系统工程研究所,湖北武汉430072;湖北第二师范学院数学与数量经济学院,湖北武汉,430205 2. 武汉大学系统工程研究所,湖北武汉,430072 3. 武汉大学数学与统计学院,湖北武汉,430072 |
| |
基金项目: | 国家自然科学基金资助项目 |
| |
摘 要: | 交通网络设计问题是指对一个已经存在的交通网络,用定量的方法确定添加哪些新路段、对哪些已有路段进行改造以提高其通行能力的问题,并分为连续网络设计问题和离散网络设计问题.针对该问题提出了一种新的离散网络平衡设计二层规划模型,模型不仅考虑了新增路段及已有路段的扩容,而且允许不同等级的扩容选择.模型求解中,上层问题采用粒子群算法,下层问题采用路径生成式logit非平衡交通分配算法.数值结果显示,本文提出的算法可以快速有效地求解这类新的网络平衡设计二层规划模型.
|
关 键 词: | 交通规划 路网平衡设计 二层规划模型 非平衡交通分配算法 粒子群算法(PSO) |
Modeling and solution method for discrete equilibrium network design based on non-equilibrium traffic assignment |
| |
Abstract: | Traffic network design problem is that improving certain paths or adding new links to an existing road network in order to achieve some kind of system optimization.This problem has been posed in two different forms: the discrete network design problem(DNDP) and the continuous network design problem(CNDP).A new bi-level programming model for the equilibrium urban road network design problems is presented;in which not only the addition of the new roads and the capacity increase of existed roads are considered,but also the different levels of capacity increase are allowed.We solve the upper model by PSO algorithm and lower model by the non-equilibrium logit traffic assignment algorithm based on paths generated by the shortest path algorithm.Numerical experiments show that the solution method presented is effective and efficient. |
| |
Keywords: | transportation planning equilibrium network design bi-level programming model non-equilibrium traffic assignment algorithm particle swarm optimization |
本文献已被 万方数据 等数据库收录! |
|