نتایج جستجو برای: global dynamic harmony search

تعداد نتایج: 1105192  

Journal: :amirkabir international journal of electrical & electronics engineering 2014
m. shafaati h. mojallali

due to the fact that the error surface of adaptive infinite impulse response (iir) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. in this case, global optimization techniques are required in order to avoid the local minima. harmony search (hs), a musical inspired metaheuristic, is a recently ...

2015
S.Karthik T.Prabaharan Ching-I Yang

In this paper a hybrid genetic and harmony search algorithm is proposed to find the possible best sequence of operation solutions for hybrid flow shop scheduling problems. In this work the problem is considered with respect to the objective of minimization of makespan. Hybrid flow shop scheduling problem is considered for the sequencing of jobs in a hybrid flow shop with two or more identical m...

2016
Carlos Alberto Cobos Lozada Andrea Duque Jamith Bolaños Martha Mendoza Elizabeth León Guzman

The clustering of web search results or web document clustering (WDC) has become a very interesting research area among academic and scientific communities involved in information retrieval. Systems for the clustering of web search results, also called Web Clustering Engines, seek to increase the coverage of documents presented for the user to review, while reducing the time spent reviewing the...

Journal: :Expert Syst. Appl. 2014
Wan-li Xiang Mei-qing An Yin-zhen Li Ruichun He Jing-fang Zhang

In this paper, an improved global-best harmony search algorithm, named IGHS, is proposed. In the IGHS algorithm, initialization based on opposition-based learning for improving the solution quality of the initial harmony memory, a new improvisation scheme based on differential evolution for enhancing the local search ability, a modified random consideration based on artificial bee colony algori...

Journal: :Inf. Sci. 2014
Ayad Mashaan Turky Salwani Abdullah

Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem incre...

H. Mojallali M. Shafaati

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

Journal: :Int. J. Computational Intelligence Systems 2016
Yanhong Feng Gaige Wang Xiao-zhi Gao

Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

Journal: :Algorithms 2016
Cinthia Peraza Fevrier Valdez Mario García Valdez Patricia Melin Oscar Castillo

Abstract: In this paper, a new fuzzy harmony search algorithm (FHS) for solving optimization problems is presented. FHS is based on a recent method using fuzzy logic for dynamic adaptation of the harmony memory accepting (HMR) and pitch adjustment (PArate) parameters that improve the convergence rate of traditional harmony search algorithm (HS). The objective of the method is to dynamically adj...

2017
Xinyu Li Kai Qin Bing Zeng Liang Gao Lijian Wang

Assembly sequence planning (ASP) plays an important role in intelligent manufacturing. As ASP is a non-deterministic polynomial (NP) hard problem, it is scarcely possible for a brute force approach to find out the optimal solution. Therefore, increasing meta-heuristic algorithms are introduced to solve the ASP problem. However, due to the discreteness and strong constraints of ASP problem, most...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید