先進先出動態旅行時間函數以及起點基礎之交通量指派演算法之研究; First-in-first-out Dynamic Travel Time Functions and Origin-based Tarffic Assignment Algorithm

NCUIR > Engineering College > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation > Item 987654321/1049

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/1049

Title:	先進先出動態旅行時間函數以及起點基礎之交通量指派演算法之研究;First-in-first-out Dynamic Travel Time Functions and Origin-based Tarffic Assignment Algorithm
Authors:	莊英鴻;Ying-Hong Zhuang
Contributors:	土木工程研究所
Keywords:	起點為基礎之演算法;旅行時間函數;先進先出;OBTAIN;travel time function;F.I.F.O.
Date:	2006-07-07
Issue Date:	2009-09-18 17:18:53 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	本研究利用含先進先出之路段旅行時間成本函數，應用於動態用路人均衡模型之中，並結合OBTAIN法於動態用路人均衡演算法中，以測試例檢測其正確性。本研究利用Carey(2003)所推導出路段旅行時間成本函數，結合Chen and Hsueh(1996)所提出之觀念，將流出率、路段車輛數轉成流入率之型式，利用巢化對角法之方法求解動態用路人均衡模型，並驗証其結果是否符合先進先出條件。 We employed this type of travel time functions with first-in-first-out (FIFO) property to resolve dynamic traffic assignment problems, and combine OBTAIN algorithm with the algorithm of dynamic traffic assignment. We will examine the correction of test example. Here we applied this type of travel time functions showed by Carey(2003), and then combine the function with nested diagonalization algorithm of dynamic traffic assignment by Chen and Hsueh(1996). And we will convert outflow variable and number of vehicle into functions of inflow variable. After we should confirm the result if matched the FIFO condition.
Appears in Collections:	[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...