Loss reduction planning is considered one of the most significant and sensitive distribution system designing studies. The planning process to reduce losses along with distributed generation sources results in a non-c...
详细信息
ISBN:
(纸本)9781467385459
Loss reduction planning is considered one of the most significant and sensitive distribution system designing studies. The planning process to reduce losses along with distributed generation sources results in a non-convex, non-linear optimization problem, mixed with integer variables, which requires complicated calculations. To solve this problem, evolutionary optimization algorithms can be used. In the present paper, loss reduction is carried out by reconfiguration the network in the light of distributed generation sources, and as a solution, a new set of harmony search algorithms, called self-adaptive algorithms are used. To verify the efficiency of the algorithm the results have been analyzed in the IEEE standard system. The findings show the strength and efficiency of this algorithm in comparison to other optimization algorithms.
Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop ...
详细信息
ISBN:
(纸本)9781467398374
Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop scheduling is considered as an important problem due to many real-world applications. The job shop scheduling problems are numerically intractable that cannot be solved in polynomial time, unless P = NP, and they are classified as NP-hard. harmony search algorithm has been successfully implemented in many optimization problems, particularly in scheduling problems, and hybridization is an effective approach for improving the solution quality of the algorithm. This paper proposes an effective hybrid harmony search algorithm for solving the job shop scheduling problems with the objective of minimizing makespan. A set of well-studied benchmarked problems is used to prove the effectiveness and efficiency of the proposed algorithm. The results indicate that the proposed hybrid harmony search algorithm improves the efficiency.
harmony search algorithm is a heuristic approach for global optimization which mimicking the improvisation process of music player, and has been applied into different engineering applications. This paper first introd...
详细信息
ISBN:
(纸本)9781479966004
harmony search algorithm is a heuristic approach for global optimization which mimicking the improvisation process of music player, and has been applied into different engineering applications. This paper first introduces the step and base flow of basic harmony search algorithm, aiming at the existent shortage, it analyzes the improved harmony search algorithm from two aspects including algorithm itself and combing with other algorithms, and then analyzes the application in multi-objective, and finally puts forward some future research lines.
Real-world networks contain variety of meaningful information inside them that can be revealed. These networks can be biological, social, ecological and technological networks. Each of these contains specific informat...
详细信息
ISBN:
(纸本)9781509004249
Real-world networks contain variety of meaningful information inside them that can be revealed. These networks can be biological, social, ecological and technological networks. Each of these contains specific information about their field. This information cannot be obtained with simple techniques. Various techniques and algorithms have been developed to uncover useful information from complex relationships inside the network. In this paper, to divide graphs according to modularity measure to subgraphs harmony search algorithm is used which is inspired by music improvisation. This algorithm has been tested with 5 different real-world networks. The obtained quantitative values for each network have been given in the tables. In addition the proposed algorithm, has achieved the best known modularity measure of Zachary's Karate Club network which is commonly used in the literature and the latest subsets generated according to this modularity measure has been given at the end of section V. According to the results obtained from experiments it has been observed that HM algorithm gives faster results on solution of problem addressed in this study than most algorithms like genetic algorithm and bat algorithm. However, the proposed algorithm requires a larger size of harmony memory and more number of iterations for maximum modularity values.
A multi-objective optimization problem is an area concerned an optimization problem involving more than one objective function to be optimized simultaneously. Several techniques have been proposed to solve Multi-Objec...
详细信息
ISBN:
(纸本)9783319265322;9783319265315
A multi-objective optimization problem is an area concerned an optimization problem involving more than one objective function to be optimized simultaneously. Several techniques have been proposed to solve Multi-Objective Optimization Problems. The two most famous algorithms are: NSGA-II and MOEA/D. harmonysearch is relatively a new heuristic evolutionary algorithm that has successfully proven to solve single objective optimization problems. In this paper, we hybridized two well-known multi-objective optimization evolutionary algorithms: NSGA-II and MOEA/D with harmonysearch. We studied the efficiency of the proposed novel algorithms to solve multi-objective optimization problems. To evaluate our work, we used well-known datasets: ZDT, DTLZ and CEC2009. We evaluate the algorithm performance using Inverted Generational Distance (IGD). The results showed that the proposed algorithms outperform in solving problems with multiple local fronts in terms of IGD as compared to the original ones (i.e., NSGA-II and MOEA/D).
The set covering problem (SCP) seeks to find a subset of columns that have the least sum of costs to cover a set of rows. It is an NP-hard problem, and finds a lot of real world applications. In this paper, we present...
详细信息
ISBN:
(纸本)9781467376792
The set covering problem (SCP) seeks to find a subset of columns that have the least sum of costs to cover a set of rows. It is an NP-hard problem, and finds a lot of real world applications. In this paper, we present a harmony search algorithm (HSA) to solve the SCP. It uses a greedy construction procedure to generate an initial harmony memory, and presents a repair operator to guarantee the feasibility of new generated solutions. New solutions are further improved by a local search procedure. The HSA is tested on 45 instances from literature. Simulation results and comparisons show that HSA can get high quality solutions of the set covering problem.
Approximate normal parameter reduction of fuzzy soft set is an important problem in fuzzy soft set. while approximate reduction is a combinatorial optimization problem, and harmony search algorithm is a good method to...
详细信息
ISBN:
(纸本)9781467371834
Approximate normal parameter reduction of fuzzy soft set is an important problem in fuzzy soft set. while approximate reduction is a combinatorial optimization problem, and harmony search algorithm is a good method to deal with combinatorial optimization problem. Therefore, in this paper we discuss approximate normal parameter reduction of fuzzy soft set based on harmony search algorithm. Firstly, a mathematical model of approximate normal parameter reduction in fuzzy soft set is constructed. Then we calculate the approximate reduction using harmony search algorithm. And example is given to show the efficiency and rapidity.
Multiprocessor task can be stated as finding a schedule for a general graph to execute on a multiprocessor system. In this paper an efficient harmony search algorithm (HSA) is proposed to solve the hybrid flow shop sc...
详细信息
ISBN:
(纸本)9781467366014
Multiprocessor task can be stated as finding a schedule for a general graph to execute on a multiprocessor system. In this paper an efficient harmony search algorithm (HSA) is proposed to solve the hybrid flow shop scheduling with multiprocessor task problems (HFSMTP). The best values of HFS's control parameters are determined by full factorial design. Computational results are compared with the genetic algorithm related to the HFSMTP at the literature. The result showed that the proposed HSA is effective for solving HFSMTP.
Nonlinear optimal control problem is transformed into a multi-objective mathematical optimization problem. harmonysearch (HS) algorithm is one of the new heuristics. In HS optimization algorithm is introduced for the...
详细信息
ISBN:
(纸本)9781467376822
Nonlinear optimal control problem is transformed into a multi-objective mathematical optimization problem. harmonysearch (HS) algorithm is one of the new heuristics. In HS optimization algorithm is introduced for the first time in solving the short-term cascade hydroelectric power generation system plan. Canal head power house of the potential energy on the release of the best estimate of the situation presented to show the feasibility and efficiency of the method compared with conventional methods, optimization algorithms HS search time becomes short, the result is close to the ideal solution, at the same time.
This paper presents an evaluation of the performance of a relatively new heuristic method called harmonysearch (HS) algorithm in the optimization of the stacking sequence of a laminated plate. The objective of the op...
详细信息
ISBN:
(纸本)9788494392825
This paper presents an evaluation of the performance of a relatively new heuristic method called harmonysearch (HS) algorithm in the optimization of the stacking sequence of a laminated plate. The objective of the optimization is to maximize the critical bucking load of a symmetric and balanced laminated plate containing 32, 48 or 64 plies with fiber orientations of 0(2)degrees, +/- 45 degrees or 90(2)degrees. The performance of the algorithm is determined based on the apparent reliability, which is used to evaluate the sensitivity of method with respect to the parameters harmony memory size (HMS), harmony memory consideration rate (HMCR) and pitch adjusting rate (PAR). Tests show that HMS has strong influence on HS performance and the best results are obtained with the higher HMS values. Less sensitivity was observed with respect to HMCR, but the PAR has a considerable effect on the apparent reliability. High levels of R were obtained with PAR values between 0.1 and 0.3. The last study investigate the effects of a linear variation of PAR during the optimization. Results indicate that PAR should be increased as the optimization advance
暂无评论