Please use this identifier to cite or link to this item:
|Title:||Solution of constrained optimization problems by multi-objective genetic algorithm|
Algebraic Process Systems
|Publisher:||PERGAMON-ELSEVIER SCIENCE LTD|
|Citation:||COMPUTERS & CHEMICAL ENGINEERING, 26(10), 1481-1492|
|Abstract:||This paper introduces a method for constrained optimization using a modified multi-objective algorithm. The algorithm treats the constraints as objective functions and handles them using the concept of Pareto dominance. The population members are ranked by two different ways: first ranking is based on objective function. value and the second ranking is based on Pareto dominance of the population members. The maintenance of elite lists for both rankings facilitates preservation of potentially superior solutions. A range of problems including non-linear programming and mixed integer non-linear programming has been solved to test the efficacy of the proposed algorithm. The algorithm effectively handles constraints encountered in both small-scale and large-scale optimization problems. The performance of the algorithm compares favourably with existing evolutionary and heuristic approaches. (C) 2002 . .|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.