A combinatorial user optimal dynamic traffic assignment algorithm

A combinatorial user optimal dynamic traffic assignment algorithm

0.00 Avg rating0 Votes
Article ID: iaor20071374
Country: Netherlands
Volume: 144
Issue: 1
Start Page Number: 249
End Page Number: 261
Publication Date: Apr 2006
Journal: Annals of Operations Research
Authors: ,
Keywords: traffic engineering
Abstract:

This paper introduces a polynomial combinatorial optimization algorithm for the dynamic user optimal problem. The approach can efficiently solve single destination networks and can be potentially extended to heuristically solve multidestinational networks. In the model, traffic is propagated according to sound traffic flow theoretical models rather than link exit functions; thereby allowing link queue evolution to be modeled more precisely. The algorithm is designed, proven, implemented and computationally tested.

Reviews

Required fields are marked *. Your email address will not be published.