Optimization of decentralized traffic networks = 분산흐름망의 최적화에 대한 연구

The Thesis presents an optimization problem of flow in decentralized networks like data transportation, traffic, population, work flow, etc., where their latency-cost functions are congestion-dependent. In the presence of congestion dependency, the shortest path is not trivially determined, but evolves in current flow, which is more realistic feature. Then we consider this system evolves as to optimize either the total cost or elemental costs individually. Accordingly, the flow pattern can be either intentionally regulated by a global optimization or emerged by individual optimization depending on type of the systems. The latter is known for settling at Nash equilibrium in game theory context. By definition,individual optimization mostly results in worse than a global optimum. This gap has been coined "the Price of Anarchy", indicating the worst inefficiency of selfishness. Nevertheless, this price can get lowered, according to Braess``s paradox, by removals of edges in a given system. Consequently, the Thesis investigates tendencies of the price of anarchy in a real system, a simplified Boston road network, and our work promises a potential implication of new methods to optimize flow in decentralized system, which is closer to reality in diverse systems.
Advisors
Jeong, Ha-Woongresearcher정하웅researcher
Publisher
한국과학기술원
Issue Date
2006
Identifier
255224/325007  / 020033420
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 물리학과, 2006.2, [ v, 36 p. ]

Keywords

Optimization; 무정부주의에의 비용; 분산화; 교통망; 최적화; Price of Anarchy; Decentralized; Traffic Networks

URI
http://hdl.handle.net/10203/48700
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=255224&flag=t
Appears in Collection
PH-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 35
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0