TY - GEN
T1 - Heuristic algorithms for dynamic traffic assignment with departure time choice
AU - Song, Ziqi
AU - Tong, Co
PY - 2005
Y1 - 2005
N2 - In this paper, we are concerned with identifying more efficient algorithms for solving dynamic traffic assignment with departure time choice problem using a discrete time simulation-based model. We compare and evaluate the performance of two heuristic algorithms: method of successive averages (MSA) and "route-swapping" algorithm. The two algorithms are tested in an example grid network, and convergence and stability of the proposed algorithms are discussed.
AB - In this paper, we are concerned with identifying more efficient algorithms for solving dynamic traffic assignment with departure time choice problem using a discrete time simulation-based model. We compare and evaluate the performance of two heuristic algorithms: method of successive averages (MSA) and "route-swapping" algorithm. The two algorithms are tested in an example grid network, and convergence and stability of the proposed algorithms are discussed.
KW - Departure time choice
KW - Dynamic traffic assignment
KW - Method of successive averages
KW - Route-swapping
KW - Solution algorithms
UR - https://www.scopus.com/pages/publications/84894550164
M3 - Conference contribution
AN - SCOPUS:84894550164
SN - 9889884712
SN - 9789889884710
T3 - Transportation and the Economy - Proceedings of the 10th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2005
SP - 53
EP - 62
BT - Transportation and the Economy - Proceedings of the 10th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2005
T2 - 10th International Conference of Hong Kong Society for Transportation Studies: Transportation and the Economy, HKSTS 2005
Y2 - 10 December 2005 through 10 December 2005
ER -