Evolutionary algorithms (EA) are robust optimization approaches which have been successfully applied to a wide range of problems. However, these well-established metaheuristic strategies are computationally expensive ...
详细信息
Evolutionary algorithms (EA) are robust optimization approaches which have been successfully applied to a wide range of problems. However, these well-established metaheuristic strategies are computationally expensive because of their slow convergence rate. Opposition Based Learning (OBL) theory has managed to alleviate this problem to some extent. Through simultaneous consideration of estimates and counter estimates of a candidate solution within a definite search space, better approximation of the candidate solution can be achieved. Although it addresses the slow convergence rate to some extent, it is far from alleviating it completely. The present work proposes a novel approach towards improving the performance of OBL theory by allowing the exploration of a larger search space when computing the candidate solution. Instead of considering all the components of the candidate solution simultaneously, the proposed method considers each of component individually and attempts to find the best possible combination by using a metaheuristic technique. In the present work, this improved Opposition learning theory has been integrated with the classical HS algorithm, to accelerate its convergence rate. A comparative analysis of the proposed method against classical Opposition Based Learning has been performed on a comprehensive set of benchmark functions to prove its superior performance.
This paper discusses a two machines permutation flow-shop scheduling problem with uncertain job processing times, where the criterion is the weighted earliness and tardiness. Uncertain processing times are described b...
详细信息
ISBN:
(纸本)9789811063732;9789811063725
This paper discusses a two machines permutation flow-shop scheduling problem with uncertain job processing times, where the criterion is the weighted earliness and tardiness. Uncertain processing times are described by interval scenarios, and a robust scheduling model is established to minimize the maximum penalties for earliness and tardiness. The property for the worst-case scenario of processing times is discussed for this scheduling model. Based on the obtained conclusion, a two-layer harmony search algorithm is proposed to address the characteristic of two-layer searching space. The inner-layer harmony search algorithm is used for searching the scenario space for a given schedule, while the outer-layer harmony search algorithm is used for searching the min-max schedule space. Finally, an extensive experiment is conducted to testify the effectiveness of the proposed algorithm and the characteristics of the min-max robust solution obtained.
Spiking Neural Network (SNN) acts as a part of the third generation of Artificial Neural Networks (ANNs). Evolving Spiking Neural Network (ESNN) is one of the most broadly utilized among in SNN models in numerous curr...
详细信息
ISBN:
(纸本)9781538604755
Spiking Neural Network (SNN) acts as a part of the third generation of Artificial Neural Networks (ANNs). Evolving Spiking Neural Network (ESNN) is one of the most broadly utilized among in SNN models in numerous current research works. During the classification process, ESNN model acts as a classifier and three parameters are used in this article. However, the parameters are needed to set manually before the classification process. To solve the stated problems, ESNN required an optimizer that able to optimize the three parameters such as similarity value, modulation factor and proportion factor. The best estimations of parameters are adaptively chosen by harmony search algorithm (HSA) to abstain from choosing appropriate values for specific issues through the trial-and-error approach. Therefore, this article proposed the integration of ESNN as a classifier and HSA as an optimizer for parameter optimization. The experimental results give favorable accuracy rates via the hybrid of ESNN and HSA.
作者:
Kim, Joong HoonKorea Univ
Sch Civil Environm & Architectural Engn Anamdong 5ga 1 Seoul 136713 South Korea
Since the harmony search algorithm (HSA) was first introduced in 2001, it has drawn a world-wide attention mainly because of its balanced combination of exploration and exploitation and ease of application. The HSA, i...
详细信息
Since the harmony search algorithm (HSA) was first introduced in 2001, it has drawn a world-wide attention mainly because of its balanced combination of exploration and exploitation and ease of application. The HSA, inspired by musical performance process, consists of three operators: random search, harmony memory considering rule, and pitch adjusting rule. The ways of handling exploration and exploitation with the three operators make the HSA a unique metaheuristic algorithm. However, a series of papers was recently published by an author which insisted that the HSA is equivalent to an evolution strategy (ES). The ES, based on ideas of adaptation and evolution, consists of two operators: recombination and mutation operators. Except the similarity in generating a single new solution at each iteration which can replace the worst solution in the population, other components (e.g., their exploration and exploitation strategies and structure) are totally different between the HSA and ES. This paper is written to rebut and point out academic flaws in the papers. (C) 2016 The Authors. Published by Elsevier Ltd.
With rapid increase in private power producers to meet the increasing power demand, results in the congestion problem. As the power transfer is increasing the operation of power systems is becoming difficult due to hi...
详细信息
ISBN:
(纸本)9788132227311;9788132227298
With rapid increase in private power producers to meet the increasing power demand, results in the congestion problem. As the power transfer is increasing the operation of power systems is becoming difficult due to higher scheduled and unscheduled power flows. Interline Power Flow Converter (IPFC) is a most flexible device and effective in reducing the congestion problem. In this paper line utilization factor (LUF) is used for finding the best location to place the IPFC. The harmonysearch (HS) algorithm is used for proper tuning of IPFC for a multi objective function which reduces active power loss, total voltage deviations, security margin and the capacity of installed IPFC of installed IPFC capacity. Simulation is carried out on IEEE-30 bus test system and the results are presented and analyzed to verify the proposed method.
Recently, harmony search algorithm (HSA) is gaining prominence in solving real-world optimization problems. Like most of the evolutionary algorithms, finding optimal solution to a given numerical problem using HSA inv...
详细信息
ISBN:
(纸本)9783662479261;9783662479254
Recently, harmony search algorithm (HSA) is gaining prominence in solving real-world optimization problems. Like most of the evolutionary algorithms, finding optimal solution to a given numerical problem using HSA involves several evaluations of the original function and is prohibitively expensive. This problem can be resolved by amalgamating HSA with surrogate models that approximate the output behavior of complex systems based on a limited set of computational expensive simulations. Though, the use of surrogate models can reduce the original functional evaluations, the optimization based on the surrogate model can lead to erroneous results. In addition, the computational effort needed to build a surrogate model to better approximate the actual function can be an overhead. In this paper, we present a novel method in which HSA is integrated with an ensemble of low quality surrogate models. The proposed algorithm is referred to as HSAES and is tested on a set of 10 bound-constrained problems and is compared with conventional HSA.
Large facilities in urban areas generate lots of traffic and cause congestion that waste social time and become a major source of greenhouse gas (GHG). To overcome a shortcoming of the fixed transportation cost in con...
详细信息
ISBN:
(纸本)9783662479261;9783662479254
Large facilities in urban areas generate lots of traffic and cause congestion that waste social time and become a major source of greenhouse gas (GHG). To overcome a shortcoming of the fixed transportation cost in conventional facility models, the congestion effect by facility users as well as general drivers in networks, with increased GHG emission is considered. In this paper, several harmony search algorithms with local search are developed and compared to the existing Tabu searchalgorithm in a variety of networks. The results demonstrate that the proposed approach and local search method can find better or comparable solution than other methods within a given time.
the rapid growth of image capturing technology has generated the digital images, which have high resolution and large size. In general, the large sized image quality is better because it has higher color intensity, bu...
详细信息
ISBN:
(纸本)9781467397919
the rapid growth of image capturing technology has generated the digital images, which have high resolution and large size. In general, the large sized image quality is better because it has higher color intensity, but data transmission is relatively slow or even failing. Image compression can improve the efficiency of storage space and transmission bandwidth usage. However, the image compression, which is categorized as lossy can reduce image quality. This paper implements improved harmonysearch (HS) algorithm for compression of color images by minimizing the reduction in image quality. The parameters of original HS algorithms including pitch adjustment rate (PAR) and fret width (FW) are fixed, whereas in improved HS algorithm, PAR and FW changed dynamically in accordance with the generation of solution vectors. Experimental results show color image compression using improved HS algorithm is better than original HS algorithm and other method.
This paper presents a new variant of the harmonysearch (HS) algorithm. This Hybrid harmonysearch (HHS) algorithm follows a new approach to improvisation: while retaining HS algorithmharmony Memory and pitch adjustm...
详细信息
This paper presents a new variant of the harmonysearch (HS) algorithm. This Hybrid harmonysearch (HHS) algorithm follows a new approach to improvisation: while retaining HS algorithmharmony Memory and pitch adjustment functions, it replaces the HS algorithm randomization function with Global-best Particle Swarm Optimization (PSO) search and neighbourhood search. HHS algorithm performance is tested on six discrete truss structure optimization problems under multiple loading conditions. Optimization results demonstrate the excellent performance of the HHS algorithm in terms of both optimum solution and the convergence behaviour in comparison with various alternative optimization methods. (C) 2016 Elsevier B.V. All rights reserved.
Like wireless sensor networks, lifetime of sensors is the main constraint for performance of underwater acoustic sensor networks (UASNs). Most previous works on UASNs did not consider dynamics of networks, i.e., as ti...
详细信息
Like wireless sensor networks, lifetime of sensors is the main constraint for performance of underwater acoustic sensor networks (UASNs). Most previous works on UASNs did not consider dynamics of networks, i.e., as time goes by, in practice, part of sensors may be malfunctioned, deplete their battery power, or get lost due to violent underwater environment changes. Therefore, this paper considers a UASN in ocean and proposes a sleep scheduling scheme in which sensor nodes and autonomous underwater vehicles in this network can dynamically choose to sleep or work to adapt to the environmental change. The concerned problem is to dynamically determine a sufficient number of active nodes in the UASN at different times, such that the targets required to be detected are covered. A special static scenario of the problem has been shown to be NP-complete. Hence, this paper proposes an improved multi-population harmony search algorithm to solve this dynamic problem. By simulation, the proposed algorithm shows high performance in terms of extending network lifetime, robustness, and computing time.
暂无评论