First-in-first-out Dynamic Travel Time Functions and Origin-based Tarffic Assignment Algorithm
碩士 === 國立中央大學 === 土木工程研究所 === 94 === 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. H...
Main Authors: | Ying-Hong Zhuang, 莊英鴻 |
---|---|
Other Authors: | Huey-Kuo Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/s4m5m5 |
Similar Items
-
A first-in-first-out memory
by: Varga, John Cleo, 1945-
Published: (1976) -
Learn, Assign, and Search: Real-Time Estimation of Dynamic Origin-Destination Flows Using Machine Learning Algorithms
by: Jishun Ou, et al.
Published: (2019-01-01) -
Letter, Boston 1990 assignments: First Round.
Published: () -
Multiple Traveling Salesman Problem Model for Fleet Assignment
by: Wei-ChihChuang, et al.
Published: (2015) -
Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem
by: Carter, Arthur E.
Published: (2014)