UP - logo
(UM)
  • Efficient multilevel MINLP strategies for solving large combinatorial problems in engineering
    Kravanja, Stojan ; Soršak, Aleksander, 1966- ; Kravanja, Zdravko
    This paper reports on the experience gained in solving large combinatorial problems by using the Outer-Approximation žEquality-Relaxation (OAžER) algorithm in two multilevel MINLP strategies. The ... first one is a Linked Multilevel Hierarchical Strategy (LMHS) and the second one is a Reduced Integer Space (RIS) strategy. Both strategies are used to decompose the original MINLP problem in a hierarchical manner into several MINLP levels thatare much easier to solve than the original one. While the first LMHS strategy can be applied to problems that contain only simple mixed-integer constraints, e.g. standard dimensions, the RIS strategy can be used to solve problems with more complex mixed-integer constraints, e.g. different design equations for alternative units. The LMHS strategy is rigorous and can solve convex problems to global optimal solutions. On the other hand, when the RIS strategy is applied for the solution of large combinatorial problems, the global optimality cannot be guaranteed, but very good solutions can be obtained. The synthesis problem of a roller steel gate for a hydroelectric power station with 19623 binary variables is presented to illustrate the LMHS strategy, whilst the synthesis problem of a heat exchanger network comprising different types of exchangers with 1782 binary variables is presented to present the RIS strategy.
    Vir: Optimization and engineering. - ISSN 1389-4420 (Vol. 4, no. 1/2, 2003, str. 97-151)
    Vrsta gradiva - članek, sestavni del
    Leto - 2003
    Jezik - angleški
    COBISS.SI-ID - 7870486

vir: Optimization and engineering. - ISSN 1389-4420 (Vol. 4, no. 1/2, 2003, str. 97-151)

loading ...
loading ...
loading ...