This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives an...This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.展开更多
Responding to complex analytical queries in the data warehouse(DW)is one of the most challenging tasks that require prompt attention.The problem of materialized view(MV)selection relies on selecting the most optimal v...Responding to complex analytical queries in the data warehouse(DW)is one of the most challenging tasks that require prompt attention.The problem of materialized view(MV)selection relies on selecting the most optimal views that can respond to more queries simultaneously.This work introduces a combined approach in which the constraint handling process is combined with metaheuristics to select the most optimal subset of DW views from DWs.The proposed work initially refines the solution to enable a feasible selection of views using the ensemble constraint handling technique(ECHT).The constraints such as self-adaptive penalty,epsilon(ε)-parameter and stochastic ranking(SR)are considered for constraint handling.These two constraints helped the proposed model select the finest views that minimize the objective function.Further,a novel and effective combination of Ebola and coot optimization algorithms named hybrid Ebola with coot optimization(CHECO)is introduced to choose the optimal MVs.Ebola and Coot have recently introduced metaheuristics that identify the global optimal set of views from the given population.By combining these two algorithms,the proposed framework resulted in a highly optimized set of views with minimized costs.Several cost functions are described to enable the algorithm to choose the finest solution from the problem space.Finally,extensive evaluations are conducted to prove the performance of the proposed approach compared to existing algorithms.The proposed framework resulted in a view maintenance cost of 6,329,354,613,784,query processing cost of 3,522,857,483,566 and execution time of 226 s when analyzed using the TPC-H benchmark dataset.展开更多
基金supported by the National Key Research and Development Program of China(Grant No.2016YFC0401702)the Fundamental Research Funds for the Central Universities(Grant No.2018B11214)the National Natural Science Foundation of China(Grants No.51379059 and 51579002)
文摘This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.
文摘Responding to complex analytical queries in the data warehouse(DW)is one of the most challenging tasks that require prompt attention.The problem of materialized view(MV)selection relies on selecting the most optimal views that can respond to more queries simultaneously.This work introduces a combined approach in which the constraint handling process is combined with metaheuristics to select the most optimal subset of DW views from DWs.The proposed work initially refines the solution to enable a feasible selection of views using the ensemble constraint handling technique(ECHT).The constraints such as self-adaptive penalty,epsilon(ε)-parameter and stochastic ranking(SR)are considered for constraint handling.These two constraints helped the proposed model select the finest views that minimize the objective function.Further,a novel and effective combination of Ebola and coot optimization algorithms named hybrid Ebola with coot optimization(CHECO)is introduced to choose the optimal MVs.Ebola and Coot have recently introduced metaheuristics that identify the global optimal set of views from the given population.By combining these two algorithms,the proposed framework resulted in a highly optimized set of views with minimized costs.Several cost functions are described to enable the algorithm to choose the finest solution from the problem space.Finally,extensive evaluations are conducted to prove the performance of the proposed approach compared to existing algorithms.The proposed framework resulted in a view maintenance cost of 6,329,354,613,784,query processing cost of 3,522,857,483,566 and execution time of 226 s when analyzed using the TPC-H benchmark dataset.