Optimal pricing and highway network improvement problem under a build-operate-transfer scheme
W. Fan
Pages: 43-54
Abstract:
As an innovative form of project financing in which a private entity receives a concession from the public sector to finance, design, construct, and operate a facility stated in the concession contract, build–operate–transfer (BOT) offers unprecedented benefits and have been gaining popularity worldwide. The purpose of this paper is to present the modeling of multiple BOT projects in network equilibrium. These projects are assumed to have been controlled by more than one private company. Thus, the effects of making combined and separate decisions of the companies on toll charge and capacity are investigated. In order to achieve this, two different genetic algorithms (GA) based bi-level optimization solution methodologies are developed to determine the optimal toll charge and capacity of the new BOT links. Numerical experimentations are conducted by considering two BOT projects, which are controlled by two companies, in the famous Sioux Fall example network. For simplicity, the demand is assumed to be fixed and given a priori and the network consists of homogenous road users whose value of times (VOT) are uniform. The two scenarios are compared with each other in terms of the total system travel time (cost). The study shows that making a combined decision on toll charge and capacity of the new BOT links gives a better network performance than making a separate decision.
Keywords: optimal pricing; highway network improvement; build-operate-transfer; genetic algorithms
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES