Parking capacity and pricing in park'n ride trips: A continuous equilibrium network design problem

DOI10.1023/A:1021332414941zbMath1013.90014OpenAlexW95575779MaRDI QIDQ1854783

Ricardo García, ángel G. Marín

Publication date: 27 January 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021332414941

zbMATH Keywords

simulated annealingnetwork design problembilevel mathematical programmingmulticommodity network equilibrium model withcombined modesparking capacity and fares in park'n ride trips

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Other game-theoretic models (91A40)

Related Items (6)

Urban rapid transit network design: accelerated Benders decomposition ⋮ An extension to rapid transit network design problem ⋮ Urban rapid transit network capacity expansion ⋮ On the optimal parking lot subscription policy problem: a hybrid simulation-optimization approach ⋮ Location of infrastructure in urban railway networks ⋮ Simultaneous estimation of the origin-destination matrices and the parameters of a nested logit model in a combined network equilibrium model

This page was built for publication: Parking capacity and pricing in park'n ride trips: A continuous equilibrium network design problem