TY - GEN

T1 - Distribution of Investment Resources among the Agents of a Megaproject based on the Network Model

AU - Plyaskina, Nina

PY - 2019/8/1

Y1 - 2019/8/1

N2 - The report proposes a step-by-step algorithm for solving the problem of distribution of investment resources in the network model of the megaproject. The megaproject is presented in the form of a directed graph without contours. The duration of each work of the network model is a random variable. Works of the network model are grouped in projects of economic agents participants of megaproject. Each agent has the directive term of the completion and also minimum and maximum admissible probability of completion of the projects in this time. The main task of resource allocation between projects is to increase the likelihood of their completion within a directive term frame with given initial volumes of investment resources of the megaproject. The algorithm is tested on the example of allocation of investment resources of PJSC Transneft by sections of Eastern Siberia-Pacific Ocean pipeline.

AB - The report proposes a step-by-step algorithm for solving the problem of distribution of investment resources in the network model of the megaproject. The megaproject is presented in the form of a directed graph without contours. The duration of each work of the network model is a random variable. Works of the network model are grouped in projects of economic agents participants of megaproject. Each agent has the directive term of the completion and also minimum and maximum admissible probability of completion of the projects in this time. The main task of resource allocation between projects is to increase the likelihood of their completion within a directive term frame with given initial volumes of investment resources of the megaproject. The algorithm is tested on the example of allocation of investment resources of PJSC Transneft by sections of Eastern Siberia-Pacific Ocean pipeline.

KW - megaproject

KW - network model

KW - resource allocation

KW - step-by-step algorithm

UR - http://www.scopus.com/inward/record.url?scp=85078049057&partnerID=8YFLogxK

U2 - 10.1109/OPCS.2019.8880224

DO - 10.1109/OPCS.2019.8880224

M3 - Conference contribution

AN - SCOPUS:85078049057

T3 - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

SP - 143

EP - 146

BT - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

Y2 - 26 August 2019 through 30 August 2019

ER -