首页|Subsea feld layout optimization (part II)-the location-allocation problem of manifolds
Subsea feld layout optimization (part II)-the location-allocation problem of manifolds
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
The location-allocation problem of manifolds, which is a part of subsea feld layout optimization, directly affects the fowline cost. This problem has always been studied as a mixed-integer nonlinear programming (MINLP) problem, or an integer linear programming (ILP) problem when there are location options for the facilities. Making a MINLP model is surely convenient to interpret the optimization problem. However, fnding the global optimum of the MINLP model is very hard. Hence, practically, engineers use approximation algorithms to search a good local optimum or give several good location options based on their experience and knowledge to reduce the MINLP model into an ILP model. Nevertheless, the global optimum of the original MINLP model is no longer guaranteed. In this study, enlightened by the graphic theories, we propose a new method in which we reduce the MINLP model into an ILP model-more precisely, a binary linear programming (BLP) model-without compromise of achieving global optimum, but also with extremely high effciency. The breakthrough in both effciency and accuracy of our method for the location-allocation problem of manifolds and wellheads is well demonstrated in various cases with comparison to the published methods and the commercial MINLP solver from LINDO. Besides, we also provide our results for larger-scale problems which were considered infeasible for the commercial MINLP solver. More generally, our method can be regarded as a specifc MINLP/NIP (nonlinear integer programming) solver which can be used for many other applications. This work is the second of a series of papers which systematically introduce an effcient method for subsea feld layout optimization to minimize the development cost.
NSTL
