Theoretical proof of edge search strategy applied to power plant start-up scheduling

Power plant start-up scheduling is aimed at minimizing the start-up time while limiting maximum turbine rotor stresses. This scheduling problem is highly nonlinear and has a number of local optima. In our previous research, we proposed an efficient search model: genetic algorithms (GAs) with enforcement operation to focus the search along the edge of the feasible space where the optimal schedule is supposed to stay. Based on a nonlinear dynamic simulation and a linear inverse calculation with the iteration method, the enforcement operation is applied to move schedules generated by GA toward the edge. We prove that the optimal schedule lies on the edge, ensuring that searching along the edge instead of the entire space can improve the search efficiency significantly without missing the optimum. Furthermore, we provide a theoretical setting equation for the inverse enforcement gains of the linear inverse calculation, intended to move schedules closer to the edge at each iteration of the enforcement operation. The theoretical setting equation is verified and discussed with the test results. We propose the theoretical setting equation with the test results as a guideline for the use of our proposed search model: GA with enforcement operation.

[1]  A. Mood.  Introduction to the theory of statistics / by Alexander M. Mood, Franklin A. Graybill, Duane C. Boes , 1963 .

[2]  S. Manson,et al.  Thermal Stress and Low-Cycle Fatigue , 2020, Encyclopedia of Continuum Mechanics.

[3]  R. Bellman.  Dynamic programming. , 1957, Science.

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Michael M. Abbott,et al.  Basic engineering thermodynamics , 1975 .

[6]  Dimitri P. Bertsekas,et al.  Numerical methods for constrained optimization , 1976 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[9]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[11]  J. D. Schaffer,et al.  Real-Coded Genetic Algorithms and Interval-Schemata , 1992, FOGA.

[12]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[13]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[14]  I. Ono,et al.  Thermal power plant start-up scheduling with evolutionary computation by using an enforcement operator , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[15]  Joseph Bentsman,et al.  Nonlinear control oriented boiler modeling-a benchmark problem for controller design , 1996, IEEE Trans. Control. Syst. Technol..

[16]  I. Ono,et al.  A Genetic Algorithm with Characteristic Preservation for Function Optimization , 1996 .

[17]  Zbigniew Michalewicz,et al.  Evolutionary Computation at the Edge of Feasibility , 1996, PPSN.

[18]  Zbigniew Michalewicz,et al.  Boundary Operators for Constrained Parameter Optimization Problems , 1997, ICGA.

[19]  Shigenobu Kobayashi,et al.  Power plant start-up scheduling: a reinforcement learning approach combined with evolutionary computation , 1998, J. Intell. Fuzzy Syst..

[20]  Isao Ono,et al.  Adaptive-edge search for power plant start-up scheduling , 1999, IEEE Trans. Syst. Man Cybern. Part C.