Traffic assignment: Methods and simulations for an alternative formulation of the fixed demand problem

Ovidiu Bagdasar, Stuart Berry, O’Neill, Sam, Nicolae Popovici and Ramachandran Raja

Mathematics and Computers in Simulation (MATCOM), 2019, vol. 155, issue C, 360-373

Abstract: Motorists 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 employed in transport modelling.

Keywords: Traffic assignment; Optimal flow; Equilibrium flow; Tabu search; Dynamic programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475418302027
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:155:y:2019:i:c:p:360-373

DOI: 10.1016/j.matcom.2018.08.004

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().