Surrogate‐based optimization of cordon toll levels in congested traffic networks |
| |
| Authors: | Joakim Ekström Ida Kristoffersson Nils‐Hassan Quttineh |
| |
| Affiliation: | 1. Communications and Transport Systems, Department of Science and Technology, Link?ping University, Norrk?ping, Sweden;2. Centre for Transport Studies, KTH Royal Institute of Technology, Stockholm, Sweden;3. Optimization, Department of Mathematics, Link?ping University, Link?ping, Sweden |
| |
| Abstract: | The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd. |
| |
| Keywords: | congestion pricing charging surrogate‐based optimization surrogate‐models optimal pricing dynamic traffic assignment |
|
|
