Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- 주제(키워드) Computational efficiency , Linear programming relaxation , Pooling problem , Rescheduling method , Second order cone relaxation , Semidefinite relaxation
- 관리정보기술 faculty
- 등재 SCIE, SCOPUS
- 발행기관 Springer New York LLC
- 발행년도 2019
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000162297
- 본문언어 영어
- Published As http://dx.doi.org/10.1007/s10898-019-00795-w
초록/요약
The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For the pooling problem with time discretization, we propose second order cone programming (SOCP) and linear programming (LP) relaxations and prove that they obtain the same optimal value as the semidefinite programming relaxation. Moreover, a rescheduling method is proposed to efficiently refine the solution obtained by the SOCP or LP relaxation. The efficiency of the SOCP and the LP relaxation and the proposed rescheduling method is illustrated with numerical results on the test instances from the work of Nishi in 2010, some large instances and Foulds 3, 4 and 5 test problems. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.
more