Van Genuchten方程是最常用的土壤水分特征曲线方程,运用该方程的关键是4个参数的取值精度。为了精确地求解这些参数,引入和声搜索(HS)算法进行求解,提出一种基于全局信息的和声搜索优化计算方法——IGHS。IGHS算法具有如下特点:利用当...Van Genuchten方程是最常用的土壤水分特征曲线方程,运用该方程的关键是4个参数的取值精度。为了精确地求解这些参数,引入和声搜索(HS)算法进行求解,提出一种基于全局信息的和声搜索优化计算方法——IGHS。IGHS算法具有如下特点:利用当前和声记忆库中的全局最优解产生新解,改变了和声搜索算法新解的产生方式;通过对和声记忆库中当前最优解的扰动避免算法早熟,增强算法的全局搜索能力;IGHS算法结构简单,容易实现。实验结果表明IGHS算法求解Van Genuchten方程参数的精度与随机微粒群结果相似,但其收敛速快、计算量小,因此可以作为计算Van Genuchten方程参数的新方法。展开更多
This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-object...This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.展开更多
Offshore wind farm(OWF) is the largest renewable energy resource. The electrical interconnection cost of OWFs is a considerable fraction of the overall design cost of the farm. In order to minimize the investment and ...Offshore wind farm(OWF) is the largest renewable energy resource. The electrical interconnection cost of OWFs is a considerable fraction of the overall design cost of the farm. In order to minimize the investment and operational costs, this paper proposes an optimization formulation to find the optimal electrical interconnection configuration of wind turbines(WTs), and the optimal cable sizing simultaneously. This simultaneous minimization of total trenching length and cable dimensions creates a complex optimization problem that is solved by the harmony search(HS) algorithm. In this paper, two distinct methods of full and partial optimal cable sizing areconsidered to comprehensively assess the optimal interconnection layout of OWFs. Furthermore, various shipping and burying costs as well as various WTs power ratings are considered in order to investigate their impact on the optimal electrical interconnection system. The optimal electrical interconnection design obtained by the HS algorithm corresponds to a lower cost that together with the technological developments can help policy makers increase the use of offshore wind energy as a feasible unlimited renewable resource in their energy production portfolios.展开更多
In this context, a novel structure was proposed for improving harmony search （HS） algorithm to solve the unit comment （UC） problem. The HS algorithm obtained optimal solution for defined objective function by impr...In this context, a novel structure was proposed for improving harmony search （HS） algorithm to solve the unit comment （UC） problem. The HS algorithm obtained optimal solution for defined objective function by improvising, updating and checking operators. In the proposed improved self-adaptive HS （SGHS） algorithm, two important control parameters were adjusted to reach better solution from the simple HS algorithm. The objective function of this study consisted of operation, start-up and shut-down costs. To confirm the effectiveness, the SGHS algorithm was tested on systems with 10, 20, 40 and 60 generating units, and the obtained results were compared with those of the simple HS algorithm and other related works.展开更多
基金supported by the National Key Research and Development Program of China(2016YFD0700605)the Fundamental Research Funds for the Central Universities(JZ2016HGBZ1035)the Anhui University Natural Science Research Project(KJ2017A891)
文摘This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.
基金Project supported by the Science and Technology Projects of General Administration of Quality Supervision,Inspection,and Quarantine of China(Nos.2009QK153 and 2009QK149)the Jiangsu Provincial Science and Technology Support Project(No.BE2012125)the Priority Academic Program Development of the Jiangsu Higher Education,China
基金support of Prof. Istva'n Erlich, chair of Electrical Power Systems department in Duisburg-Essen University, Duisburg, Germany
文摘Offshore wind farm(OWF) is the largest renewable energy resource. The electrical interconnection cost of OWFs is a considerable fraction of the overall design cost of the farm. In order to minimize the investment and operational costs, this paper proposes an optimization formulation to find the optimal electrical interconnection configuration of wind turbines(WTs), and the optimal cable sizing simultaneously. This simultaneous minimization of total trenching length and cable dimensions creates a complex optimization problem that is solved by the harmony search(HS) algorithm. In this paper, two distinct methods of full and partial optimal cable sizing areconsidered to comprehensively assess the optimal interconnection layout of OWFs. Furthermore, various shipping and burying costs as well as various WTs power ratings are considered in order to investigate their impact on the optimal electrical interconnection system. The optimal electrical interconnection design obtained by the HS algorithm corresponds to a lower cost that together with the technological developments can help policy makers increase the use of offshore wind energy as a feasible unlimited renewable resource in their energy production portfolios.
文摘In this context, a novel structure was proposed for improving harmony search （HS） algorithm to solve the unit comment （UC） problem. The HS algorithm obtained optimal solution for defined objective function by improvising, updating and checking operators. In the proposed improved self-adaptive HS （SGHS） algorithm, two important control parameters were adjusted to reach better solution from the simple HS algorithm. The objective function of this study consisted of operation, start-up and shut-down costs. To confirm the effectiveness, the SGHS algorithm was tested on systems with 10, 20, 40 and 60 generating units, and the obtained results were compared with those of the simple HS algorithm and other related works.
