臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：Apply the Information of Sensitivity Analysis of Equilibrium Network Flow to the Solution Algorithm for the Network Design Problems
書刊名：交大管理學報
作者：卓訓榮 引用關係
出版日期：1990
卷期：10:1
頁次：頁19-34
主題關鍵詞：分析；方法；均衡；求解；流量；敏感性；設計；資訊；路網
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:23
本研究將以Tobin和Friesz(1988)，Smith等(1989)和Cho等(1989)的均衡路網流量敏感性分析的結果為基礎，發展路網設計的求解方法。本研究中路網設計的問題是以變動不等式(Variational Inequality)為限制式的數學規劃來表示，而求解方法則是以敏感性分析為基礎，再加上以Armijo型態的步距(Stepsize)規則發展出的梯度下降法(Gradient Descent Method)。最後本研究亦討論了此求解法的收斂性及提供一計算例子。藉以說明此方法的可行性。
In this research we will apply the sensitivity analysis results of Tobin and Friesz (1988), or, Smith et al. (1988), or, Cho et al (1989), to solve the equilibrium network design problem formulated as a mathematical program with variational inequality constraints. We will present a sensitivity-based algorithm, a gradient descent method. We show that, under certain conditions, this algorithm converges to a local solution and we also provide numerical examples. Numerical results are presented to illustrate the potential of this technique for solving network design problems.
期刊論文
1.Tobin, R. L.、Friesz, T. L.(1988)。Sensitivity Analysis for Equilibrium Network Flow。Transportation Science，22(4)，242-250。  new window
2.Dafermos, S. C.、Nagurney, A.(1984)。Sensitivity Analysis for the Asymmetric Network Equilibrium Problem。Mathematical Programming，28(2)，174-184。  new window
3.Leblanc, L. J.(1975)。An algorithm for the discrete network design problem。Transportation Science，9，183-199。  new window
4.Magnanti, T. L.、Wong, R. T.(1984)。Network Design and Transportation Planning: Models and Algorithms。Transportation Science，18(1)，1-55。  new window
5.Suwansirikul, C.、Friesz, T. L.、Tobin, R. L.(1987)。Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem。Transportation Science，21(4)，254-263。  new window
6.Bard, J. F.(1983)。Optimality Conditions for the Bilevel Programming problem。Navel Research Logistics Quarterly，31(1)，13-26。  new window
7.Abdulaal, M.、LeBlanc, L. J.(1979)。Continuous Equilibrium Network Design Models。Transportation Research，13B，19-32。  new window
8.Fiacco, A. V.(1976)。Sensitivity Analysis for Nonlinear Programming Using Penalty Methods。Mathematical Programming，10，287-311。  new window
9.Friesz, T. L.、Harker, P. T.(1985)。Properties of the Iterative Optimization Equilibrium Algorithm。Civil Engineering System，2，142-154。  new window
10.Friesz, T. L.(1985)。Transportation Network Equilibrium, Design and Aggregation。Transportation Research，19A，413-427。  new window
11.Fisk, C.(1979)。More Paradoxes in the Equilibrium Assignment Problem。Transportation Research，13B(4)，305-309。  new window
12.Marcotte, P.(1986)。Network Design Problem With Congestion Effects: A Case of Bilevel Programming。Mathematical Programming，34，142-162。  new window
13.Marcotte, P.(1983)。Network Optimization with Continuous Control Parameters。Transportation Science，17(2)，181-197。  new window
14.LeBlanc, L. J.、Boyce, D. E.(1986)。A Bilevel Programming Algorithm for Exact Solution of the Network Design Problem with User-Optimal Flows。Transportation Research，20B(3)，259-265。  new window
15.Smith, T. E.、Friesz, T. L.、Cho, H.-J.、Tobin, R. L.(1989)。A Reduction Method for Local Sensitivity Analysis for Network Equilibrium Arc Flow。Transportation Science。  new window
16.Smith, T. E.(1978)。A Cost-Efficiency Principle of Spatial Interaction Behavior。Regional Science and Urban Economics，8，313-337。  new window
17.Pearman, A. D.(1979)。The Structure of the Solution Set to Network Optimization Problems。Transportation Research，13B，81-90。  new window
18.Tobin, R. L.(1986)。Sensitivity Analysis for Variational Inequalities。Journal of Optimization Theory and Applications，48，191-204。  new window
會議論文
1.Allsop, R. E.(1974)。Some Possibilities for Using Traffic Control to Influence Trip Distribution and Route Choice。The Sixth International Symposium on Transportation and Traffic Theory。Elsevier。345-374。  new window
研究報告
1.Cho, H.-J.、Friesz, T. L.、Tobin, R. L.(1989)。Moore-Penrose Generalized Inverse Approach to Sensitivity Analysis of Equilibrium Network Flow。Dept. of Tran. Eng. and Mang., National Chiao Tung University。  new window
2.Kolstad, C. D.(1985)。A Review of the Literature on Bi-Level Mathematical Programming。Los Alamos, NM。  new window
3.Harker, P. T.、Choi, S. C.(1987)。A Penalty Function Approach for Mathematical Programs with Variational Inequality Constraints。University of Pennsylvania。  new window
4.Tan, H. N.、Gershwin, S. B.、Athaus, M.(1979)。Hybrid Optimization in Urban Traffic Networks。Cambridge, MA：Laboratory for Information and Decision System, M.I.T.。  new window
5.Suh, S.、Kim, T. J.(1988)。A Solution for Nonlinear Bilievel Programming Models of the Equilibrium Network Design Problem。Dept. of Urban and Regional Planning, U. of Illinois at Urbana-Champaign。  new window
學位論文
1.De Silva, A. H.(1978)。Sensitivity Formulas for Nonlinear Factorable Programming and Their Application to the Solution of an Implicitly Defined Optimization Models of US Crude Oil Production(-)。George Washington University，Washington, DC。  new window
圖書
1.Steenbrink, P. A.(1974)。Optimization of Transport Network。New York：John Wiley。  new window
2.Bertsekas, D. P.(1982)。Constrained Optimization and Lagrange Multiplier Methods。New York：Academic Press。  new window
3.Fiacco, A. V.、McCormick, G. P.(1968)。Nonlinear Programming: Sequential Uncinstrainted Minimization Techniques。John Wiley & Sons。  new window
4.Smith, T. E.(1988)。Class Notes。Dept, of Regional Science, Uni. of Penn.。  new window
5.Beckmann, M. J.、McGuire, C. B.、Winston, C. B.(1956)。Studies in the Economics of Transportation。New Haven, Connecticut：Yale University Press。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：1481（臺灣：1436，外國：45） ／ 本年度總使用人次：2516201 ／ 訪客人次（自102年09月）：68322619
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上