화학공학소재연구정보센터
Chemical Engineering & Technology, Vol.28, No.12, 1500-1510, 2005
Solving multi-objective MILP problems in process synthesis using the multi-criteria branch and bound algorithm
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.