| 求解用户平衡与系统最优模型的新算法 |
| |
| 引用本文： | 韦增欣,高苏銮,石婷,赵秋梅. 求解用户平衡与系统最优模型的新算法[J]. 数学的实践与认识, 2012, 42(7): 133-141 |
| |
| 作者姓名： | 韦增欣 高苏銮 石婷 赵秋梅 |
| |
| 作者单位： | 广西大学数学与信息科学学院,广西南宁,530004 |
| |
| 基金项目： | 国家自然科学基金，广西壮族自治区研究生教育创新项目 |
| |
| 摘 要： | 近些年,国内外许多学者针对交通规划提出了诸如用户平衡(UE)、系统最优(SO)等模型,但由于交通网络的复杂性,这些模型的求解相对困难,考虑到在一般的UE、S0模型中,其约束条件为线性约束与非负约束,给出一种求解交通规划模型的新算法,算法不需使用任何线搜索,只要通过求解一个简单的二次规划问题得到下降方向即可,最后,将该算法应用到简单的交通网络中,并通过与相继平均法(MSA)进行比较,验证了该算法的收敛速度较快。
|
| 关 键 词： | 用户平衡 系统最优 二次规划 全局收敛性 |
A New Algorithm for Solving User Equilibrium and System Optimization Models |
| |
| WEI Zeng-xin , GAO Su-luan , SHI Ting , ZHAO Qiu-mei. A New Algorithm for Solving User Equilibrium and System Optimization Models[J]. Mathematics in Practice and Theory, 2012, 42(7): 133-141 |
| |
| Authors: | WEI Zeng-xin GAO Su-luan SHI Ting ZHAO Qiu-mei |
| |
| Affiliation: | (College of Mathematics and Information Science,Guangxi University,Nanning 530004,China) |
| |
| Abstract: | Recently,many authors have obtained lots of traffic models,such as User Equilibrium, System Optimization etc.It is difficult to solve these models for the complexity of the traffic network.Considering linear and non-negative constraint conditions of UE and SO models,we give a new algorithm for solving general transport plan models.In this algorithm, we obtain the descent direction only by solving a simple quadratic programming without any line searches.Finally,the new algorithm is used in a simple traffic network. Meanwhile,compared with the MSA method,we can confirm that this algorithm has a fast convergence speed. |
| |
| Keywords: | user equilibrium system optimization quadratic programming global convergence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
