| Popis: |
The optimal scheduling of DES is to solve a multi-objective optimization problem (MOP) with complex constraints. However, the potential contradiction between multiple optimization objectives leads to the diversity of feasible solutions, which has a serious impact on the selection of optimal scheduling strategies. Therefore, a stepper search optimization (SSO) method has been proposed for a bi-objective optimization problem (BiOP). Firstly, a constrained single-objective optimization problem (CSiOP) has been established to transform a BiOP and describe an accurate pareto front curve. Then, based on the characteristics of pareto front, the rate of the pareto front is analyzed by the SSO, and the best recommended solution of the BiOP is obtained. Finally, in the IEEE 33 with a DES simulation, by comparing other methods, the SSO method can better control the bi-objective optimization results to be 1–2.5 times as much as the optimal result under each single optimization objective and avoid the imbalance between the two optimization objectives. Additionally, the optimization speed of the SSO method is more than 10 times faster than that of the non-dominated sorting genetic algorithm (NSGA). Further, the SSO method will provide a novel idea for solving MOP. |
