期刊
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION
卷 3, 期 1, 页码 53-78出版社
ELSEVIER
DOI: 10.1007/s13675-014-0029-0
关键词
Mixed-integer nonlinear programming; Relaxations; Heuristics; Duality; Nonlinear network design applications
资金
- Open Grid Europe GmbH (OGE, Essen/Germany)
- Konrad-Zuse-Fellowship
We present a novel heuristic to identify feasible solutions of amixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point of a nonlinear relaxation. Based on the information from the KKT point we alter some of the binary variables in a locally promising way exploiting our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据