Show simple item record

dc.contributor.authorBagdasar, Ovidiu
dc.contributor.authorBerry, Stuart
dc.contributor.authorO’Neill, Sam
dc.contributor.authorPopovici, Nicolae
dc.contributor.authorRaja, Ramachandran
dc.date.accessioned2018-09-17T13:16:44Z
dc.date.available2018-09-17T13:16:44Z
dc.date.issued2018-08-30
dc.identifier.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.004en
dc.identifier.issn0378-4754
dc.identifier.doi10.1016/j.matcom.2018.08.004
dc.identifier.urihttp://hdl.handle.net/10545/622987
dc.description.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.
dc.description.sponsorshipMinistry of Research and Innovation, CNCS-UEFISCDI, project number PN-III- P2-2.1-BG-2016-0333, within PNCDI III.en
dc.language.isoenen
dc.publisherElsevieren
dc.relation.urlhttps://linkinghub.elsevier.com/retrieve/pii/S0378475418302027en
dc.rightsArchived with thanks to Mathematics and Computers in Simulationen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectTraffic assignmenten
dc.subjectOptimal flowen
dc.subjectEquilibrium flowen
dc.subjectTabu searchen
dc.subjectDynamic programmingen
dc.titleTraffic assignment: methods and simulations for an alternative formulation of the fixed demand problemen
dc.typeArticleen
dc.contributor.departmentUniversity of Derbyen
dc.contributor.departmentTechnical University of Cluj-Napocaen
dc.identifier.journalMathematics and Computers in Simulationen
dc.date.accepted2018-08-15
refterms.dateFOA2019-08-08T00:00:00Z
html.description.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.


Files in this item

Thumbnail
Name:
Publisher version
Thumbnail
Name:
ICMMCMSE17-paper-Revised2.pdf
Size:
860.8Kb
Format:
PDF
Description:
Revised manuscript - accepted ...

This item appears in the following Collection(s)

Show simple item record

Archived with thanks to Mathematics and Computers in Simulation
Except where otherwise noted, this item's license is described as Archived with thanks to Mathematics and Computers in Simulation