Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
MetadataShow full item record
AbstractMotorists often face the dilemma of choosing the route enabling them to realise the fastest (i.e., shortest) journey time. In this paper we examine discrete and continuous optimisation and equilibrium-type problems for a simplified parallel link traffic model using a variance based approach. Various methodologies used for solving these problems (brute force, dynamic programming, tabu search, steepest descent) are explored and comparison is made with the Beckmann cost function traditionally employed in transport modelling.
CitationBagdasar, O. et al. (2018) "Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem", Mathematics and Computers in Simulation, 155, pp.360-373. DOI:10.1016/j.matcom.2018.08.004
JournalMathematics and Computers in Simulation
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Archived with thanks to Mathematics and Computers in Simulation