To solve the lot-streaming flow shop scheduling problem with the objective to minimize the total weighted earliness and tardiness, a hybrid discrete harmonysearch (HDHS) algorithm is proposed in this paper. Firstly, ...
详细信息
ISBN:
(纸本)9783037850275
To solve the lot-streaming flow shop scheduling problem with the objective to minimize the total weighted earliness and tardiness, a hybrid discrete harmonysearch (HDHS) algorithm is proposed in this paper. Firstly, an effective harmony memory initialization approach is presented,an initial solution in harmony memory is generated by means of the famous NEH heuristic. Secondly, the HDHS algorithm utilizes an effective improvisation mechanism to generate new harmonies represented by job permutations. Lastly, the insert neighborhood search and swap operator are designed and embedded in the algorithm to enhance the local exploitation. Experimental results demonstrate the effectiveness of the proposed HDHS algorithms.
Allpass group delay equalizer design using harmony search algorithm is presented. Chebyshev IIR lowpass and bandpass digital filters are first designed to meet given passband and stopband(s) magnitude response specifi...
详细信息
ISBN:
(纸本)9781538668122;9781538668115
Allpass group delay equalizer design using harmony search algorithm is presented. Chebyshev IIR lowpass and bandpass digital filters are first designed to meet given passband and stopband(s) magnitude response specifications. For each of the lowpass and bandpass digital filters, a cascaded allpass digital filter is then designed to equalize the BR passband group delay such that the normalized group delay error of the combined passband group delay is minimized The allpass equalizer design results indicate that the approach using harmony search algorithm is effective.
This paper presents a study on harmony search algorithm with application. A disadvantage of HAS is trapped into the local optimum easily, so many improved algorithms about the HAS have been presented by research schol...
详细信息
ISBN:
(纸本)9781538612446
This paper presents a study on harmony search algorithm with application. A disadvantage of HAS is trapped into the local optimum easily, so many improved algorithms about the HAS have been presented by research scholars. We, in this paper, reviewed many methods published in the journals, which have been valued in some aspects, such as dynamic parameters adjustment, self-adaptive adjustment, global search and local search strategy, even the HS combined with other intelligent algorithms.
At present, many improved algorithms have effectively improved the ability to converge to the optimal value. However, there are still difficulties: how to effectively balance the deep development ability of the algori...
详细信息
ISBN:
(纸本)9783031366215;9783031366222
At present, many improved algorithms have effectively improved the ability to converge to the optimal value. However, there are still difficulties: how to effectively balance the deep development ability of the algorithm in a small range and the extensive exploration ability in the global search field in the iterative process. For this reason, this topic first proposes a population state evaluation indicator, which continuously detects the state and diversity of the population with iteration. On this basis, the dual-strategy competition mechanism is adopted. Through the population state evaluation index, the strategy can select a strategy that is more conducive to rapid convergence according to the changes of the population during the iteration process. Through the advantage competition of the two strategies, the development ability of the algorithm has been steadily and persistently improved. However, there is still the risk of falling into the local optimal dilemma. Therefore, the change of population diversity is considered in the evaluation index of population status in this study. In order to further increase the activity of the global search range, the computational individuals used in the proposed environmental assessment index of population diversity are randomly selected. In general, in the greedy comparison of the two strategies, this study still ensures the consideration and influence of diversity, and effectively balances the ability of algorithm exploration and development.
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...
详细信息
ISBN:
(纸本)9781424451821
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.
The permeable pavement is one of representative Low Impact Development (LID) facilities which were used to reduce flooding and recover the water cycle in urban environments. Since the unit cost of porous pavement is g...
详细信息
ISBN:
(纸本)9783662479261;9783662479254
The permeable pavement is one of representative Low Impact Development (LID) facilities which were used to reduce flooding and recover the water cycle in urban environments. Since the unit cost of porous pavement is greater than that of non-porous pavement, the designs of permeable pavement need to consider reduction effect of rainwater runoff and cost of facilities. These are determined by the size and location of facilities. In this study, the optimal design of permeable pavement, considering the size and location of that, was simulated in a developed optimization model using the harmonysearch (HS) algorithm connected to the Storm Water Management Model (SWMM) to calculate urban Rainfall-Runoff.
This paper presents a discrete harmonysearch(DHS) algorithm for solving an n-job,m-machine lot-streaming flowshop scheduling problem(LFSP) with equal-size sublots, the objective is to minimize the total flow time. In...
详细信息
ISBN:
(纸本)9783642259432
This paper presents a discrete harmonysearch(DHS) algorithm for solving an n-job,m-machine lot-streaming flowshop scheduling problem(LFSP) with equal-size sublots, the objective is to minimize the total flow time. In the proposed DHS algorithm. The discrete job permutation without any conversion is used in the proposed DHS algorithm. To search for the best sequence,the DHS algorithm uses an effective initialization approach and a novel improvisation strategy. At the same time, an effective local search is embedded. Computational results demonstrate that the proposed DHS algorithm is very effectiveness for the lot-streaming flowshop scheduling problem.
This paper proposes a modified global harmonysearch (MGHS) algorithm with random crossover algorithm to solve continuous high dimensional optimization problems. For the problem of premature convergence in harmony sea...
详细信息
ISBN:
(纸本)9781728101057
This paper proposes a modified global harmonysearch (MGHS) algorithm with random crossover algorithm to solve continuous high dimensional optimization problems. For the problem of premature convergence in harmony search algorithm, in the improvisation stage of MGHS algorithm, the new harmony vector is generated dynamically by means of random crossover for the global optimization problems, i.e., the worst harmony learning from the best harmony and the random selected other harmony learning from the best harmony random crossover strategy. Finally. MGHS algorithm is applied in the simulation test of 8 benchmark functions, the simulation results demonstrate the MGHS algorithm has higher convergence precision and convergence rate.
Design optimization of reinforced concrete structures is more challenging than that of steel structures due to the complexity associated with reinforcement design. In this study, optimum design algorithm is presented ...
详细信息
ISBN:
(纸本)9781905088386
Design optimization of reinforced concrete structures is more challenging than that of steel structures due to the complexity associated with reinforcement design. In this study, optimum design algorithm is presented for reinforced concrete continuous beams. The design variables are selected as the width and the depth of beams in each span, the diameter and the number of longitudinal reinforcement bars along span and supports, and the diameter of ties. The design constraints are implemented from ACI 318-05 which covers the flexural and shear strength, serviceability, the minimum and maximum steel percentage for flexural and shear reinforcement, the spacing requirements for the stirrups and the upper and lower bound requirements for the width and the depth of the beam section. The objective function is considered as the total cost of continuous beam which includes the cost of concrete, formwork and reinforcing steel bars. The cost of any component is inclusive of material, fabrication and labour. The design algorithm automatically updates the value of the dead load which includes self-weight of the continuous beam depending on the cross-sectional dimensions during the design cycles. The optimum design problem formulated according to ACI 318-05 with the design variables mentioned above turns out to be a discrete programming problem. The harmony search algorithm (HS) is utilized to obtain its solution. harmony search algorithm has been applied to various engineering design optimization problems and is found quite effective in finding the optimum solutions. It is quite simple and has few parameters to initialize. It needs relatively less number of function evaluations to reach the optimum solution. Due to these advantages, harmonysearch method is used to obtain the solution of the design problem. Numbers of design examples taken from the literature are included to demonstrate the efficiency and robustness of the optimum design algorithm presented.
This paper develops an opposition-based learning harmony search algorithm with mutation (OLHS-M) for solving global continuous optimization problems. The proposed method is different from the original harmonysearch (...
详细信息
ISBN:
(纸本)9781479937066
This paper develops an opposition-based learning harmony search algorithm with mutation (OLHS-M) for solving global continuous optimization problems. The proposed method is different from the original harmonysearch (HS) in three aspects. Firstly, opposition-based learning technique is incorporated to the process of improvisation to enlarge the algorithmsearch space. Then, a new modified mutation strategy is instead of the original pitch adjustment operation of HS to further improve the search ability of HS. Effective self-adaptive strategy is presented to fine-tune the key control parameters (e.g. harmony memory consideration rate HMCR, and pitch adjustment rate PAR) to balance the local and global search in the evolution of the search process. Numerical results demonstrate that the proposed algorithm performs much better than the existing improved HS variants that reported in recent literature in terms of the solution quality and the stability.
暂无评论