Abstract
This work presents the development of multi-objective harmony search (MOHS) algorithm for optimization problem using self-adaptive improved harmony search (SIHS) algorithm which is a variant of recently developed harmony search algorithm (HS) for single objective optimization. The approach used in this work is decomposing of multiple objectives into several single objective functions which are simultaneously optimized in such a way that a nearly uniform distribution of the solutions along the pareto-front is followed. The algorithm upon testing for standard test functions has shown promising results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Abbreviations
- BW:
-
Band Width
- DE:
-
Differential Evolution
- DV:
-
Decision Variables
- EA:
-
Evolutionary Algorithm
- GA:
-
Genetic Algorithm
- HMCR:
-
Harmony Memory Consideration Rate
- HSA:
-
Harmony Search Algorithm
- HS:
-
Harmony search
- PAR:
-
Pitch Adjustment Rate
- PF:
-
Pareto Front
- IHS:
-
Improved Harmony Search
- SIHS:
-
Self-adaptive Improved harmony search algorithm
- SPEA:
-
Strength Pareto Evolutionary Algorithm
- IHSA:
-
Improved Harmony Search Algorithm
- MOEA:
-
Multi-Objective Evolutionary algorithm
- MOGA:
-
Multi-Objective Genetic Algorithm
- MOHS:
-
Multi-Objective Harmony Search
- MOOP:
-
Multi-Objective Optimization Problem
- NOI:
-
Number of Iterations
- NPGA:
-
Niche Pareto Genetic Algorithm
- NSGA:
-
Non-dominated Sorting Genetic Algorithm
References
Geem, Z.W., Kim, J.H.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)
Fonseca, C.M., Fleming, P.J.: Genetic algorithms for multiobjective optimization: formulation, discssions and generalization. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference. Morgan Kaufmann, San Mateo (1993)
Horn, J., Nafpliotis, N., Goldberg, D.E.: A niched pareto genetic algorithm for multiobjective optimization. In: Proceedings of the First IEEE Conference on Evolutionary Computation, vol. 1, pp. 82–87 (1994)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms : a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. TIK-Report 103, 1–21 (2001)
Deb, K., Member, A., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Zhang, Q., Member, S., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Ricart, J., Hüttemann, G., Lima, J., Barán, B.: Multiobjective harmony search algorithm proposals. Electron. Notes Theor. Comput. Sci. 281, 51–67 (2011)
Sivasubramani, S., Swarup, K.S.: Multi-objective harmony search algorithm for optimal power flow problem. Int. J. Electr. Power Energy Syst. 33(3), 745–752 (2011)
Pavelski, L.M., Almeida, C.P., Goncalves, R.A.: Harmony Search for Multi-objective Optimization. In: 2012 Brazilian Symposium on Neural Networks, pp. 220−225 (2012)
Wang, Ling, Mao, Yunfei, Niu, Qun, Fei, Minrui: A multi-objective binary harmony search algorithm. In: Tan, Ying, Shi, Yuhui, Chai, Yi, Wang, Guoyin (eds.) ICSI 2011, Part II. LNCS, vol. 6729, pp. 74–81. Springer, Heidelberg (2011)
Yang, X.: Harmony search as a metaheuristic algorithm. In: Proceedings of Studies in Computational Intelligence, vol. 191, pp. 1−18 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Jain, S., Kalivarapu, J., Bag, S. (2015). Development of Self-consistent Multi-objective Harmony Search Algorithm. In: Panigrahi, B., Suganthan, P., Das, S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2014. Lecture Notes in Computer Science(), vol 8947. Springer, Cham. https://doi.org/10.1007/978-3-319-20294-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-20294-5_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20293-8
Online ISBN: 978-3-319-20294-5
eBook Packages: Computer ScienceComputer Science (R0)