Scope of stationary multi-objective evolutionary optimization: a case study on a hydro-thermal power dispatch problem

被引:20
作者
Deb, Kalyanmoy [1 ]
机构
[1] Indian Inst Technol, Dept Mech Engn, Kanpur 208016, Uttar Pradesh, India
基金
芬兰科学院;
关键词
multi-objective optimization; Kuhn-Tucker conditions; evolutionary optimization; robust optimization; large-scale optimization;
D O I
10.1007/s10898-007-9261-y
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Many engineering design and developmental activities finally resort to an optimization task which must be solved to get an efficient and often an intelligent solution. Due to various complexities involved with objective functions, constraints, and decision variables, optimization problems are often not adequately suitable to be solved using classical point-by-point methodologies. Evolutionary optimization procedures use a population of solutions and stochastic update operators in an iteration in a manner so as to constitute a flexible search procedure thereby demonstrating promise to such difficult and practical problem-solving tasks. In this paper, we illustrate the power of evolutionary optimization algorithms in handling different kinds of optimization tasks on a hydro-thermal power dispatch optimization problem: (i) dealing with non-linear, non-differentiable objectives and constraints, (ii) dealing with more than one objectives and constraints, (iii) dealing with uncertainties in decision variables and other problem parameters, and (iv) dealing with a large number (more than 1,000) variables. The results on the static power dispatch optimization problem are compared with that reported in an existing simulated annealing based optimization procedure on a 24-variable version of the problem and new solutions are found to dominate the solutions of the existing study. Importantly, solutions found by our approach are found to satisfy theoretical Kuhn-Tucker optimality conditions by using the subdifferentials to handle non-differentiable objectives. This systematic and detail study demonstrates that evolutionary optimization procedures are not only flexible and scalable to large-scale optimization problems, but are also potentially efficient in finding theoretical optimal solutions for difficult real-world optimization problems.
引用
收藏
页码:479 / 515
页数:37
相关论文
共 47 条
[1]  
[Anonymous], 2004, NONLINEAR PROGRAMMIN
[2]  
[Anonymous], 1971, OPTIMIZATION METHODS
[3]   A simulated annealing-based goal-attainment method for economic emission load dispatch of fixed head hydrothermal power systems [J].
Basu, M .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2005, 27 (02) :147-153
[4]  
Bector C.R., 2005, PRINCIPLES OPTIMIZAT
[5]  
Clarke FH, 1990, Optimization and Nonsmooth Analysis, DOI DOI 10.1137/1.9781611971309
[6]  
Deb K, 2005, LECT NOTES COMPUT SC, V3410, P150
[7]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[8]   Optimal scheduling of casting sequence using genetic algorithms [J].
Deb, K ;
Reddy, AR ;
Singh, G .
MATERIALS AND MANUFACTURING PROCESSES, 2003, 18 (03) :409-432
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]  
Deb K., 1995, Complex Systems, V9, P115