We use an effective global harmony search algorithm(EGHS)to solve two kinds of pressure vessel design *** general,the two problems are formulated as mixed-integer non-linear programming problems with several *** EGHS ...
详细信息
We use an effective global harmony search algorithm(EGHS)to solve two kinds of pressure vessel design *** general,the two problems are formulated as mixed-integer non-linear programming problems with several *** EGHS combines harmony search algorithm(HS)with concepts from the swarm intelligence of particle swarm optimization algorithm(PSO)to solve the two optimization *** EGHS algorithm has been applied to two typical problems with results better than previously *** results have demonstrated that the EGHS has strong convergence and capacity of space exploration on solving pressure vessel design problems.
This paper proposes a novel discrete harmonysearch (DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup times. Unlike the traditional harmonysearch (HS)...
详细信息
This paper proposes a novel discrete harmonysearch (DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup times. Unlike the traditional harmonysearch (HS) algorithm, the proposed DHS algorithm utilizes job permutations to represent harmonies and applies a job-permutation-based improvisation to generate new harmonies. To enhance the algorithm’s searching ability, an effective initialization scheme based on the NEH heuristic is developed to construct an initial harmony memory with certain quality and diversity, and an efficient local searchalgorithm based on the insert neighborhood structures is fused to stress the local exploitation. Extensive computational simulations and comparisons are provided, which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.
We use an effective global harmony search algorithm (EGHS) to solve two kinds of pressure vessel design problems. In general, the two problems are formulated as mixed-integer non-linear programming problems with sever...
详细信息
We use an effective global harmony search algorithm (EGHS) to solve two kinds of pressure vessel design problems. In general, the two problems are formulated as mixed-integer non-linear programming problems with several constraints. The EGHS combines harmony search algorithm (HS) with concepts from the swarm intelligence of particle swarm optimization algorithm (PSO) to solve the two optimization problems. The EGHS algorithm has been applied to two typical problems with results better than previously reported. The results have demonstrated that the EGHS has strong convergence and capacity of space exploration on solving pressure vessel design problems.
This paper proposes a novel discrete harmonysearch(DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup *** the traditional harmonysearch (HS) algorithm,...
详细信息
This paper proposes a novel discrete harmonysearch(DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup *** the traditional harmonysearch (HS) algorithm,the proposed DHS algorithm utilizes job permutations to represent harmonies and applies a job-permutation-based improvisation to generate new *** enhance the algorithm's searching ability,an effective initialization scheme based on the NEH heuristic is developed to construct an initial harmony memory with certain quality and diversity,and an efficient local searchalgorithm based on the insert neighborhood structures is fused to stress the local *** computational simulations and comparisons are provided,which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.
Distribution network reconfiguration is a multi objective and discrete nonlinear combinatory optimization problem. In this paper, a novel multi-object distribution network reconfiguration method is proposed based on s...
详细信息
ISBN:
(纸本)9781467381321
Distribution network reconfiguration is a multi objective and discrete nonlinear combinatory optimization problem. In this paper, a novel multi-object distribution network reconfiguration method is proposed based on system homogeneity. Firstly, the relationship between power loss and reliability of systems with different homogeneity is analyzed. Then, to enhance system reliability and homogeneity, a new multi-objective model is established by coupling the reliability index with system homogeneity. Based on the adaptive settings and fast iteration method, an improved multi-objective harmony search algorithm is proposed to solve the model. The test results on the 33-bus system show that the proposed method is corrective and effective.
Metaheuristics form a family of optimization algorithms for solving combinatorial optimization problems by applying the research procedures to quickly find a good approximation of the best solution. In this paper we p...
详细信息
ISBN:
(纸本)9781467396691
Metaheuristics form a family of optimization algorithms for solving combinatorial optimization problems by applying the research procedures to quickly find a good approximation of the best solution. In this paper we proposed a new metaheuristic novel hybrid penguins search optimization algorithm (NPeSOA) which is based on the combination of penguins search optimization algorithm (PeSOA) and harmony search algorithm (HS) to solve the Travelling Salesman Problem. The search for harmony was added to improve the research technique of PeSOA method. The results of this experience are tested by the instances of TSPLib, and compared with the methods of PeSOA and HS to show the efficiency of NPeSOA.
Detection of faulty antenna element in arrays is one of the hot area of research in the field of adaptive beamforming which has direct applications in radar, sonar, mobile communication etc. Due to element failure, th...
详细信息
ISBN:
(纸本)9781479963690
Detection of faulty antenna element in arrays is one of the hot area of research in the field of adaptive beamforming which has direct applications in radar, sonar, mobile communication etc. Due to element failure, the radiation pattern of array is damaged in terms of sidelobes levels, nulls depth and displacement of nulls from their original positions. In order, to correct the faulty pattern, first it is important to precisely detect the respective faulty antenna element. In this work, we introduce hybrid nature inspire technique based on harmonysearch and firefly algorithm (HS-FA) to detect the position of faulty element in arrays. The HS-FA has shown fairly good accuracy and fast convergence as compared to HS and FA alone. The performance criterion is based on cost function (fitness function) which defines an error between the degraded and estimated power patterns. The simulation results are carried out for Dolph Chebyshev array which consists of 30 elements.
Automation of analog integrated circuit (IC) design process is very important because of the optimization contradictions. In this study, benefits of multi-objective evolutionary algorithms are presented on two stage o...
详细信息
ISBN:
(纸本)9781479984985
Automation of analog integrated circuit (IC) design process is very important because of the optimization contradictions. In this study, benefits of multi-objective evolutionary algorithms are presented on two stage operational amplifier design using harmony search algorithm (HSA) and Non-dominated Sorting Genetic algorithm (NSGA-II). HSA is a new kind of multi-objective evolutionary algorithm which was inspired from the musicians those are looking for the best combination of musical sounds of different instruments that produces most pleasing sound. NSGA-II is an advanced version of genetic algorithm. It combines both current parents and their child population to select new parents. These kinds of design automation tools are required for analog circuit design because there are several contradictions in the design. In this work, transistor sizes which effects all constraints indirectly were automatically synthesized by HSA an NSGA-II.
Gene selection, which is a well-known NP-hard problem, is a challenging task that ha S been the subject of a large amount of research, especially in relation to classification tasks. This problem addresses the identif...
详细信息
Gene selection, which is a well-known NP-hard problem, is a challenging task that ha S been the subject of a large amount of research, especially in relation to classification tasks. This problem addresses the identification of the smallest possible set of genes that could achieve good predictive performance. Many gene selection algorithms have been proposed;however, because the search space increases exponentially with the number of genes, finding the best possible approach for a solution that would limit the search space is crucial. Metaheuristic approaches have the ability to discover a promising area without exploring the whole solution space. Hence, we propose a new method that hybridises the harmony search algorithm (HSA) and the Markov Blanket (MB), called HSA-MB, for gene selection in classification problems. In this proposed approach, the HSA (as a wrapper approach) improvises a new harmony that is passed to the MB (treated as a filter approach) for further improvement. The addition and deletion of operators based on gene ranking information is used in the MB algorithm to further improve the harmony and to fine-tune the search space. The HSA-MB algorithm method works especially well on selected genes with higher correlation coefficients based on symmetrical uncertainty. Ten microarray datasets were experimented on, and the results demonstrate that the HSA-MB has a performance that is comparable to state-of-the-art approaches. HSA-MB yields very small sets of genes while preserving the classification accuracy. The results suggest that HSA-MB has a high potential for being an alternative method of gene selection when applied to microarray data and can be of benefit in clinical practice. (C) 2013 Elsevier Inc. All rights reserved.
Most of the visual attention models are based on the concept of a two-dimensional saliency map, which encodes the conspicuity of the object in the visual scene. The visual attention model proposed by Laurent Itti is u...
详细信息
Most of the visual attention models are based on the concept of a two-dimensional saliency map, which encodes the conspicuity of the object in the visual scene. The visual attention model proposed by Laurent Itti is used in this work. In Itti's model, the saliency map is calculated via combining the information across several modalities, including color, intensity, and orientation. In this work, we propose a pre-training process to select the weightings used in the combining of feature maps to make the target more conspicuity in the saliency map. harmonysearch (HS) algorithm is used in the pre-training process to obtain the weightings. HS is a new heuristic algorithm, which mimics the improvisation of music players. Its performance has been verified by many benchmark *** modify the pitch adjustment process of the original HS to improve the optimization performance and accelerate the convergence rate. The modified algorithm is named Gaussian harmonysearch (GHS). (C) 2013 Elsevier GmbH. All rights reserved.
暂无评论