Modified Diagonalization Method for VIP Model

碩士 === 國立交通大學 === 土木工程研究所 === 82 === Equilibrium network flow can be formulated as Varia- tional Inequality Problem (VIP) without symmetric assumption. Diagonalization method is one of the approaches to slove the equilibrium pro...

Full description

Bibliographic Details
Main Authors: Dennif Day, 戴邦芳
Other Authors: Hsun-Jung Cho
Format: Others
Language:zh-TW
Published: 1994
Online Access:http://ndltd.ncl.edu.tw/handle/62049484615975274219
id ndltd-TW-082NCTU0015072
record_format oai_dc
spelling ndltd-TW-082NCTU00150722016-07-18T04:09:34Z http://ndltd.ncl.edu.tw/handle/62049484615975274219 Modified Diagonalization Method for VIP Model 變分不等式路網均衡指派模式對角化求解方法改良之研究 Dennif Day 戴邦芳 碩士 國立交通大學 土木工程研究所 82 Equilibrium network flow can be formulated as Varia- tional Inequality Problem (VIP) without symmetric assumption. Diagonalization method is one of the approaches to slove the equilibrium problem of the VIP model. Although the Diagonalization method is very easy to implement, the slow convergence of it's subproblem affects the performance of the method drastically. In the past, there are two strategies have been reported to improve it's computional efficiency on the origional approach : streamlined method and Harker's method. In this thesis, it is found that the performance of the streamlined method is very unstable and the use of Harker's accelerated step can't outperform the origional approach. As a result of these facts, we present two accelerated strategies on the former two strategies. The computional performance of all these strategies that mentioned above explored by numerical experiment.It is shown that the strategies we proposed can considerably reduce the algorithm's computional requirements. We also use these results to illustrate something that we should notice on the comparison basis of the computional performance for different algorithms. Hsun-Jung Cho 卓訓榮 1994 學位論文 ; thesis 63 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立交通大學 === 土木工程研究所 === 82 === Equilibrium network flow can be formulated as Varia- tional Inequality Problem (VIP) without symmetric assumption. Diagonalization method is one of the approaches to slove the equilibrium problem of the VIP model. Although the Diagonalization method is very easy to implement, the slow convergence of it's subproblem affects the performance of the method drastically. In the past, there are two strategies have been reported to improve it's computional efficiency on the origional approach : streamlined method and Harker's method. In this thesis, it is found that the performance of the streamlined method is very unstable and the use of Harker's accelerated step can't outperform the origional approach. As a result of these facts, we present two accelerated strategies on the former two strategies. The computional performance of all these strategies that mentioned above explored by numerical experiment.It is shown that the strategies we proposed can considerably reduce the algorithm's computional requirements. We also use these results to illustrate something that we should notice on the comparison basis of the computional performance for different algorithms.
author2 Hsun-Jung Cho
author_facet Hsun-Jung Cho
Dennif Day
戴邦芳
author Dennif Day
戴邦芳
spellingShingle Dennif Day
戴邦芳
Modified Diagonalization Method for VIP Model
author_sort Dennif Day
title Modified Diagonalization Method for VIP Model
title_short Modified Diagonalization Method for VIP Model
title_full Modified Diagonalization Method for VIP Model
title_fullStr Modified Diagonalization Method for VIP Model
title_full_unstemmed Modified Diagonalization Method for VIP Model
title_sort modified diagonalization method for vip model
publishDate 1994
url http://ndltd.ncl.edu.tw/handle/62049484615975274219
work_keys_str_mv AT dennifday modifieddiagonalizationmethodforvipmodel
AT dàibāngfāng modifieddiagonalizationmethodforvipmodel
AT dennifday biànfēnbùděngshìlùwǎngjūnhéngzhǐpàimóshìduìjiǎohuàqiújiěfāngfǎgǎiliángzhīyánjiū
AT dàibāngfāng biànfēnbùděngshìlùwǎngjūnhéngzhǐpàimóshìduìjiǎohuàqiújiěfāngfǎgǎiliángzhīyánjiū
_version_ 1718351456329793536