A Novel Self-Adaptive Harmony Search Algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved adaptive binary Harmony Search algorithm

Article history: Received 3 September 2011 Received in revised form 9 December 2012 Accepted 31 December 2012 Available online 16 January 2013

متن کامل

Harmony Search algorithm: a variant with Self-regulated Fretwidth

This article presents a novel modification of the Harmony Search (HS) algorithm that is able to self-tune as the search progress. This adaptive behavior is independent of total iterations. Moreover, it requires less iterations and provides more precision than other variants of HS. Its effectiveness and performance was assessed, comparing our data against four well known and recent modifications...

متن کامل

A self-adaptive harmony PSO search algorithm and its performance analysis

Harmony Search (HS) algorithm is a new population-based meta-heuristic which imitates the music improvisation process and has been successfully applied to a variety of combination optimization problems. In this paper, a self-adaptive harmony particle swarm optimization search algorithm, named SHPSOS, is proposed to solve global continuous optimization problems. Firstly, an efficient initializat...

متن کامل

A Novel Wireless Fire Alert System Using Harmony Search Algorithm

In today’s world,we are fazed by different types of emergencies in the indoor environment .One such emergency is fire outbreak. Thus, reliable and quick detection of fire is essential. Most prevalently used technology for this purpose is wireless sensor networks(WSN). A system is proposed that enables practical development of centralized cluster-based protocols supported by optimization methods...

متن کامل

An improved self-adaptive harmony search algorithm for joint replenishment problems

To solve joint replenishment problems (JRPs) effectively and efficiently which are typical NP-hard problems, an improved self-adaptive harmony search algorithm (ISHS) is designed. The proposed algorithm applies differential evolution mutation strategies to HS. Experimental results show that ISHS outperforms other start-of-art algorithms on both tested benchmark functions and typical JRPs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics

سال: 2013

ISSN: 1110-757X,1687-0042

DOI: 10.1155/2013/653749