IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v29y2011i5p535-548.html
   My bibliography  Save this article

Identifying the Pareto-front approximation for negotiations of BOT contracts with a multi-objective genetic algorithm

Author

Listed:
  • Fen-may Liou
  • Chien-hui Yang
  • Boarliang Chen
  • Weichi Chen

Abstract

The build-operate-transfer (BOT) project is formulated based upon cooperative partnerships among various public and private parties. Win-win negotiation solutions are especially essential for parties that usually have conflicts of interests. A simulation-based multi-objective genetic algorithm (SMOGA) procedure is developed to address conflicts among the objectives of three parties: government and consumer interests that focus on users' rights and social welfare; the private investor's pursuit of profit maximization; and lenders who want to control the solvency risk of the concessionaire. Taking the Kaohsiung cable car project in Taiwan as an example, the SMOGA procedure is used to seek terms and conditions lying on or near the Pareto frontier for BOT projects with multi-objectives. Monte Carlo simulation is conducted first to determine the project risks and generate the sample data used as the input of the genetic algorithm (GA). The GA subsequently generates a number of combinations of concessional terms and conditions that approximately and simultaneously optimize the three conflicting objectives. The GA-generated approximate Pareto frontier provides a decision space of financial and concessional terms and conditions that satisfies all parties and facilitates the negotiations of BOT contracts.

Suggested Citation

  • Fen-may Liou & Chien-hui Yang & Boarliang Chen & Weichi Chen, 2011. "Identifying the Pareto-front approximation for negotiations of BOT contracts with a multi-objective genetic algorithm," Construction Management and Economics, Taylor & Francis Journals, vol. 29(5), pages 535-548.
    • Handle: RePEc:taf:conmgt:v:29:y:2011:i:5:p:535-548
    DOI: 10.1080/01446193.2011.564196
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/01446193.2011.564196
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01446193.2011.564196?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:conmgt:v:29:y:2011:i:5:p:535-548. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.