Skip to main content
SpringerLink
Log in

A quantum multi-objective optimization algorithm based on harmony search method

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The purpose of multi-objective optimization is to simultaneously optimize several objective functions that are usually in conflict with each other. An acceptable solution is one that can strike a trade-off between the results of these functions. Although, multi-objective evolutionary algorithms have a good history in solving multi-objective problems, how to find more accurate and diverse solutions set at an acceptable time is still a challenge. In this study, a quantum-inspired multi-objective harmony search algorithm is proposed to solve multi-objective optimization problems. In this algorithm, a new quantum mutation strategy is proposed, which is a combination of harmony improvisation operators and a quantum adaptive rotation gate. While the use of the rotation gate leads to the move to further solutions and complete coverage of the problem space, the improvisation operators (PAR and BW) trigger tiny impulses and mutate into neighbor solutions. The advantage of such an algorithm is to strengthen the balance between the exploration and exploitation processes. Also, the crowding distance metric of the elitism strategy ensures the production of solutions with maximum variety in the problem space. The results of the implementation of this algorithm on multi-objective benchmark functions indicate significant improvement in criteria such as the distance to Pareto optimal, the scattering, and the convergence rate compared to the state-of-the-art methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Abualigah LM (2019) Feature selection and enhanced Krill Herd algorithm for text document clustering. Part of the studies in computational intelligence book series (SCI, volume 816), pp 11–19

  • Abualigah LM, Khader AT, Hanandeh ES (2018a) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48:4047–4071

    Article  Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018b) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456–466

    Article  Google Scholar 

  • Bouaziz A, Draa A, Chikhi S (2013) A quantum-inspired artificial bee colony algorithm for numerical optimization. In: 11th International Symposium Programming and Systems (ISPS), proceedings, pp 81–88

  • Chakraborti T, Chatterjee A, Halder A, Konar A (2015) Automated emotion recognition employing a novel modified binary quantum-behaved gravitational search algorithm with differential mutation. Expert Syst 32:522–530

    Article  Google Scholar 

  • Coelho L (2008) A quantum particle swarm optimizer with chaotic mutation operator. Chaos Soliton Fract 37:1409–1418

    Article  Google Scholar 

  • Corne DW, Knowles JD, Oates MJ (2000) The Pareto-envelope based selection algorithm for multi-objective optimization. In: 6th International conference on parallel problem solving from nature, pp 869–878

  • Dahi ZAM, Mezioud C, Draa A (2016) A quantum-inspired genetic algorithm for solving the antenna positioning problem. Swarm Evol Comput 31:24–63

    Article  Google Scholar 

  • Dai H, Yang Y, Li C (2014) Bi-direction quantum crossover-based clonal selection algorithm and its applications. Expert Syst Appl 41:7248–7258

    Article  Google Scholar 

  • Deb K (1998) Multi-objective genetic algorithms: problem difficulties and construction of test functions, Technical Report No. CI-49/98. Department of Computer Science/XI, University of Dortmund, Germany

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197

    Article  Google Scholar 

  • Deng W, Junjie X, Gao XY, Zhao H (2020a) An enhanced msiqde algorithm with novel multiple strategies for global optimization problems. IEEE Trans Syst Man, Cybern Syst. https://doi.org/10.1109/TSMC.2020.3030792

    Article  Google Scholar 

  • Deng W, Junjie X, Gao XY, Zhao H (2020b) A novel gate resource allocation method using improved PSO-based QEA. IEEE Trans Intell Transp Syst. https://doi.org/10.1109/TITS.2020.3025796

    Article  Google Scholar 

  • Deng W, Liu H, Xu J, Zhao H, Song Y (2020c) An improved quantum-inspired differential evolution algorithm for deep belief network. IEEE Trans Instrum Meas 69:7319–7327

    Article  Google Scholar 

  • Diao R, Shen Q (2012) Feature selection with harmony search. IEEE T Syst Man Cy B 42:1509–1523

    Article  Google Scholar 

  • Ding W, Guan Z, Shi Q, Wang J (2015) A more efficient attribute self-adaptive co-evolutionary reduction algorithm by combining quantum elitist frogs and cloud model operators. Inform Sci 293:214–234

    Article  Google Scholar 

  • Feynman RP (1982) Simulating physics with computers. Int J Theor Phys 21:467–488

    Article  MathSciNet  Google Scholar 

  • Geem ZW, Sim KB (2010) Parameter-setting-free harmony search algorithm. Appl Math Comput 217:3881–3889

    MathSciNet  MATH  Google Scholar 

  • Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76:60–68

    Article  Google Scholar 

  • Grover L (1996) A fast quantum mechanical algorithm for database search. In: 28th Annual ACM symposium on the theory of computing, proceedings, pp 210–219

  • Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6:580–593

    Article  Google Scholar 

  • Han F, Sun YWT, Ling QH (2018) An improved multi-objective quantum-behaved particle swarm optimization based on double search strategy and circular transposon mechanism. Complexity. https://doi.org/10.1155/2018/8702820

    Article  Google Scholar 

  • Horn J, Nafploitis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization, In: First IEEE conference on evolutionary computation, proceedings, pp 82–87

  • Hosseinnezhad V, Rafiee M, Ahmadian M, Ameli M (2014) Species-based quantum particle swarm optimization for economic load dispatch. Int J Elect Power Energy Syst 63:311–322

    Article  Google Scholar 

  • Hsieh MS, Wu SC (2019) Modified quantum evolutionary algorithm and self-regulated learning for reactor loading pattern design. Ann Nucl Energy 127:268–277

    Article  Google Scholar 

  • Hwang CL, Masud ASM (1979) Multiple objective decision making—methods and applications: a state-of-the-art survey. Springer, Heidelberg

    Book  Google Scholar 

  • Jin C, Jin SW (2015) Automatic image annotation using feature selection based on improving quantum particle swarm optimization. Signal Process 109:172–181

    Article  Google Scholar 

  • Kim JH (2016) Harmony search algorithm: a unique music-inspired algorithm. Procedia Eng 154:1401–1405

    Article  Google Scholar 

  • Knowles JD, Corne DW (2000a) Approximating the non-dominated front using the Pareto archived evolution strategy. Evol Comput 8:149–172

    Article  Google Scholar 

  • Knowles JD, Corne DW (2000b) M-PAES: A Memetic Algorithm for Multi-objective optimization, In 2000 Congress on Evolutionary Computation (CECOO), proceeding, pp 325–332

  • Konak A, Coit DW, Smith AE (2005) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992–1007

    Article  Google Scholar 

  • Layeb A (2013) A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems. J Comput Appl Math 253:14–25

    Article  MathSciNet  Google Scholar 

  • Ma X, Li YG (2012) An improved quantum ant colony algorithm and its application. IERI Procedia 2:522–527

    Article  Google Scholar 

  • Manjarres D, Landa-Torres I, Gill-Lopez S, Del Ser J, Bilbao MN, Salcedo-Sanz S, Geem ZW (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intel 26:1818–1831

    Article  Google Scholar 

  • Moghadam MS, Nezamabadi-Pour H, Farsangi MM (2012) A quantum behaved gravitational search algorithm. Intell Inf Manag 2012:390–395

    MATH  Google Scholar 

  • Montiel O, Castillo O, Melin P, Sepulveda R (2008) Mediative fuzzy logic: a new approach for contradictory knowledge management. SoftComput 12:251–256

    MATH  Google Scholar 

  • Moore P, Venayagamoorthy GK (2005) Evolving combinational logic circuits using a hybrid quantum evolution and particle swarm inspired algorithm. In: Proceedings of NASA/DoD conference evolvable hardware (EH), pp 97–102

  • Nielsen MA, Chuang IL (2010) Quantum computation and quantum information, 10th Anniversary. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Pandiarajan K, Babulal CK (2016) Fuzzy harmony search algorithm based optimal power flow for power system security enhancement. Int J Electr Power Energ Syst 78:72–79

    Article  Google Scholar 

  • Ramos A, Vellasco M (2020) Chaotic quantum-inspired evolutionary algorithm: enhancing feature selection in BCI. In: 2020 IEEE congress on evolutionary computation (CEC), proceedings, pp 1–8

  • Rashedi E, Nezamabadi-Pour H, Saryazdi S (2010) BGSA: binary gravitational search algorithm. Natural Comput 9:727–745

    Article  MathSciNet  Google Scholar 

  • Shor P (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual IEEE symposium on foundations of computer science, proceedings, pp 124–134

  • Soliman M, Hassanien AE, Onsi HM (2016) An adaptive watermarking approach based on weighted quantum particle swarm optimization. Neural Comput Appl 27:469–481

    Article  Google Scholar 

  • Srinivas N, Deb K (1994) Multi-objective optimization using non-dominated sorting in genetic algorithms. Evol Comput 2:221–248

    Article  Google Scholar 

  • Tereshko V, Loengarov A (2005) Collective decision-making in honey bee foraging dynamics. Comput Inf Syst J 9:1–7

    Google Scholar 

  • Veldhuizen DAV, Lamout G (2000) Multi-objective optimization with Messy Genetic Algorithms. In: 2000 ACM symposium on applied computing, proceedings, pp 470–476

  • Wang CM, Huang YF (2010) Self-adaptive harmony search algorithm for optimization. Expert Syst Appl 37:2826–2837

    Article  Google Scholar 

  • Wang L, Li L (2010) An effective hybrid quantum-inspired evolutionary algorithm for parameter estimation of chaotic systems. Expert Syst Appl 37:1279–1285

    Article  Google Scholar 

  • Wang Y, Feng X, Huang Y, Pu D, Zhou W, Liang Y, Zhou C (2007) A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70:633–640

    Article  Google Scholar 

  • Wang L, Mao Y, Niu Q, Fei M (2011) A multi-objective binary harmony search algorithm. In: Second international conference, ICSI 2011—proceedings, pp 74–81

  • Whitley D, Rana S, Dzubera J, Mathias KE (1996) Evaluating evolutionary algorithms. Artif Intell 85:245–276

    Article  Google Scholar 

  • Wittkowski KM (1988) Friedman-type statistics and consistent multiple comparisons for unbalanced designs with missing data. J Am Stat Assoc 83:1163–1170

    Article  MathSciNet  Google Scholar 

  • Xiao J, Li JJ, Hong XX (2018) An improved MOEA/D based on reference distance for software project portfolio optimization. Complexity. https://doi.org/10.1155/2018/3051854

    Article  Google Scholar 

  • Yi J, Lu Ch, Li G (2019) A literature review on latest developments of Harmony Search and its applications to intelligent manufacturing. Math Biosci Eng 16:2086–2117

    Article  MathSciNet  Google Scholar 

  • Zhao S, Xu G, Tao T, Liang L (2009) Real-coded chaotic quantum-inspired genetic algorithm for training of fuzzy neural networks. Comput Math with Appl 57:2009–2015

    Article  Google Scholar 

  • Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257–271

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Mashhad Branch, Islamic Azad University, Mashhad, Iran

    Alireza Sadeghi Hesar, Seyed Reza Kamel & Mahboobeh Houshmand

Authors
  1. Alireza Sadeghi Hesar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed Reza Kamel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mahboobeh Houshmand
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Reza Kamel.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sadeghi Hesar, A., Kamel, S.R. & Houshmand, M. A quantum multi-objective optimization algorithm based on harmony search method. Soft Comput 25, 9427–9439 (2021). https://doi.org/10.1007/s00500-021-05799-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-05799-x

Keywords

Search

Navigation