Stochastic local search for the strategic planning public-private partnership

Alexander A. Zyryanov, Yury A. Kochetov, Sergey M. Lavlinskii

Research output: Contribution to journalConference articlepeer-review

Abstract

We present a new bi-level linear integer programming model for the strategic planning of the public-private partnership. This model is an extension of the previously studied models where the ecological, infrastructure, and production projects have known schedules into the planning horizon if they start. A stochastic local search matheuristic is designed for this new problem according to the upper level variables. The optimal solution for the lower level is obtained by CPLEX software. To reduce the running time, we use randomized Flip and Swap neighborhoods. To evaluate the neighboring solutions, we solve the lower level problem approximately with a small fixed deviation from the optimum. Computational results for real world instances for the Tranbaikalian polymetal fields are discussed.

Original languageEnglish
Pages (from-to)446-463
Number of pages18
JournalCEUR Workshop Proceedings
Volume2098
Publication statusPublished - 1 Jan 2018
Event2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 - Omsk, Russian Federation
Duration: 8 Jul 201814 Jul 2018

Keywords

  • Bilevel mathematical programming problem
  • Local search
  • Public-private partnership
  • Stackelberg game

Fingerprint

Dive into the research topics of 'Stochastic local search for the strategic planning public-private partnership'. Together they form a unique fingerprint.

Cite this