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...

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...

ALI SHANON ALSAADI, TAT-CHEE WAN AND ALHAMZA MUNTHER Computer Engineering and Computer Science Department University of Louisville Louisville, KY 40292 USA School of Computer Sciences Universiti Sains Malaysia Penang, 11800 Malaysia School of Computer and Communication Engineering Universiti Malaysia Perlis Perlis, 02600 Malaysia E-mail: [email protected]; [email protected]; g1340811014@...

the operation of a distribution system in the presence of distributed generation systems has someadvantages and challenges. optimal sizing and siting of dg systems has economic, technical, andenvironmental benefits in distribution systems. improper selection of dg systems can reduce theseadvantages or even result in deterioration in the normal operation of the distribution system. dgallocation ...

Harmony Search metaheuristic is successfully used in several applications of science and engineering. However, its effectiveness in solving multiobjective optimization problems using the concepts of Pareto optimality, remains unproved. This paper presents two proposals of the Harmony Search metaheuristic for multiobjective optimization, using the ZDT functions as a test bed. Performance metrics...

The harmony search (HS) is a music-inspired evolutionary algorithm, mimicking the improvisation process of music players (Geem et al., 2001). The HS is simple in concept, few in parameters, and easy in implementation, with theoretical background of stochastic derivative (Geem, 2007a). The algorithm was originally developed for discrete optimization and later expanded for continuous optimization...

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...