نتایج جستجو برای: harmony search algorithm
تعداد نتایج: 986450 فیلتر نتایج به سال:
The objective of this paper is to present an optimal design for single-layer barrel vault frames via improved magnetic charged system search (IMCSS) and open application programming interface (OAPI). The IMCSS algorithm is utilized as the optimization algorithm and the OAPI is used as an interface tool between analysis software and the programming language. In the proposed algorithm, magnetic c...
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...
one of the mostly used enhanced oil recovery methods is the injection of water or gas under pressure to maintain or reverse the declining pressure in a reservoir. several parameters should be optimized in a fluid injection process. the usual optimizing methods evaluate several scenarios to find the best solution. since it is required to run the reservoir simulator hundreds of times, the process...
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0–1 knapsack problems. Theproposed algorithm includes two important operations: positionupdating andgeneticmutationwith a small probability. The former enables the worst harmony of harmony memory to move to the global best harmony rapidly in each iteration, and the latter can effectively prevent theNGHS from trapping in...
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four s...
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...
The Harmony Search (HS) algorithm is a new evolutionary metaheuristic algorithm based on natural musical performance processes that occur when a musician searches for a better state of harmony, such as during jazz improvisation. In the HS algorithm, the solution vector is analogous to the harmony in music, and the local and global search schemes are analogous to musician’s improvisations.The HS...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید