Search: WFRF:(Quttineh Nils Hassan) >
Surrogate-based opt...
-
Ekström, Joakim,1980-Linköpings universitet,Kommunikations- och transportsystem,Tekniska högskolan,Trafiksystem
(author)
Surrogate-based optimisation of toll levels in congestion pricing schemes
- Article/chapterEnglish2014
Publisher, publication year, extent ...
-
Hong Kong :Hong Kong Society of Transportation Studies Limited,2014
-
printrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:liu-112786
-
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112786URI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
There has recently been a growing interest in analysing road pricing schemes in urban areas using dynamic traffic assignment (DTA) tools. Finding optimal toll levels in cordon based road pricing schemes has so far mainly been studied using either derivative-free heuristics or ascent methods. For future use of DTA tools such methods are not suitable and in this paper we investigate how a surrogate modelling framework can be used instead. We focus on cases when the number of costly objective function evaluations is limited to between 20 and 40. In order to allow a large number of different configurations of the surrogate modelling framework to be evaluated, a static user equilibrium model is used for simulating the road users’ response to a given pricing scheme. The results show that for a realistic scenario, valuable information on close to optimal toll levels can be achieved with only 20 costly function evaluations.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Quttineh, Nils-HassanLinköpings universitet,Optimeringslära,Tekniska högskolan(Swepub:liu)nilqu94
(author)
-
Linköpings universitetKommunikations- och transportsystem
(creator_code:org_t)
Related titles
-
In:Transportation InfrastructureHong Kong : Hong Kong Society of Transportation Studies Limited, s. 209-2169789881581433
Internet link
Find in a library
To the university's database