Premium
Solving Multi‐objective MILP Problems in Process Synthesis using the Multi‐Criteria Branch and Bound Algorithm
Author(s) -
Mavrotas G.,
Diakoulaki D.
Publication year - 2005
Publication title -
chemical engineering and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.403
H-Index - 81
eISSN - 1521-4125
pISSN - 0930-7516
DOI - 10.1002/ceat.200500135
Subject(s) - mathematical optimization , branch and bound , integer programming , linear programming , computer science , maximization , process (computing) , set (abstract data type) , branch and price , branch and cut , integer (computer science) , pareto principle , algorithm , mathematics , programming language , operating system
The paper briefly describes the problem of process synthesis in the area of chemical engineering, and suggests its formulation as a Multi‐Objective Programming problem. Process synthesis optimization is usually modeled as Mixed Integer Linear Programming (MILP) or Mixed Integer Non‐Linear Programming (MINLP) with an economic objective function. We claim that incorporating more criteria (e.g., environmental criteria) in this kind of combinatorial optimization problem offers the decision makers the opportunity to refine their final decision by examining more than one solution (a set of efficient or Pareto optimal solutions instead of one optimal solution). For solving the multi‐objective process synthesis problem, an improved version of the Multi‐Criteria Branch and Bound (MCBB) algorithm, which has been developed by the same authors, is used. MCBB is a vector maximization algorithm capable of deriving all efficient points (supported and unsupported), for small and medium sized Multi‐Objective MILP problems. The application of MCBB in two examples from process synthesis is also presented.