Design and Simulation of Simulated Annealing Algorithm with Harmony Search
نویسندگان
چکیده
Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by harmony search. So it has the advantage of high quality and efficiency. The simulation results show that this new algorithm has faster convergence speed and better optimization quality than the traditional simulated annealing algorithm and other algorithms.
منابع مشابه
A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملOptimal cost design of water distribution networks using harmony search
This study presents a cost minimization model for the design of water distribution networks. The model uses a recently developed harmony search optimization algorithm while satisfying all the design constraints. The harmony search algorithm mimics a jazz improvisation process in order to find better design solutions, in this case pipe diameters in a water distribution network. The model also in...
متن کاملA Hybrid Harmony Search / Simulated Annealing Algorithm for Minimizing Mean Flow Time on Two Identical Parallel Machines with a Single Server
In this paper, we consider the problem of scheduling a set of jobs on two parallel machines to minimize the sum of completion times. Each job requires a setup which must be done by a single server. It is known that this problem is strongly NP-hard. We propose an improved harmony search algorithm. The performance of this algorithm is evaluated and compared with a pure simulated annealing algorit...
متن کاملChoice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed
We compare six metaheuristic optimization algorithms applied to solving the travelling salesman problem. We focus on three classical approaches: genetic algorithms, simulated annealing and tabu search, and compare them with three recently developed ones: quantum annealing, particle swarm optimization and harmony search. On top of that we compare all results with those obtained with a greedy 2-o...
متن کاملMultiresponse surface optimization via Harmony search algorithm (Quality Engineering Conference Paper)
Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...
متن کامل