Solving the Asymmetry Multi-Objective Optimization Problem in PPPs under LPVR Mechanism by Bi-Level Programing

Optimizing the cost and benefit allocation among multiple players in a public-private partnership (PPP) project is recognized to be a multi-objective optimization problem (MOP). When the least present value of revenue (LPVR) mechanism is adopted in the competitive procurement of PPPs, the MOP presen...

Full description

Bibliographic Details
Main Authors: Feiran Liu, Jun Liu, Xuedong Yan
Format: Article
Language:English
Published: MDPI AG 2020-10-01
Series:Symmetry
Subjects:
Online Access:https://www.mdpi.com/2073-8994/12/10/1667
Description
Summary:Optimizing the cost and benefit allocation among multiple players in a public-private partnership (PPP) project is recognized to be a multi-objective optimization problem (MOP). When the least present value of revenue (LPVR) mechanism is adopted in the competitive procurement of PPPs, the MOP presents asymmetry in objective levels, control variables and action orders. This paper characterizes this asymmetrical MOP in Stackelberg theory and builds a bi-level programing model to solve it in order to support the decision-making activities of both the public and private sectors in negotiation. An intuitive algorithm based on the non-dominated sorting genetic algorithm III (NSGA III) framework is designed to generate Pareto solutions that allow decision-makers to choose optimal strategies from their own criteria. The effectiveness of the model and algorithm is validated via a real case of a highway PPP project. The results reveal that the PPP project will be financially infeasible without the transfer of certain amounts of exterior benefits into supplementary income for the private sector. Besides, the strategy of transferring minimum exterior benefits is more beneficial to the public sector than to users.
ISSN:2073-8994