A Quantum Inspired Evolutionary Framework for Multi-objective Optimization

This paper provides a new proposal that aims to solve multi-objective optimization problems (MOPs) using quantum evolutionary paradigm. Three main features characterize the proposed framework. In one hand, it exploits the states superposition quantum concept to derive a probabilistic representation encoding the vector of the decision variables for a given MOP. The advantage of this representation is its ability to encode the entire population of potential solutions within a single chromosome instead of considering only a gene pool of individuals as proposed in classical evolutionary algorithms. In the other hand, specific quantum operators are defined in order to reward good solutions while maintaining diversity. Finally, an evolutionary dynamics is applied on these quantum based elements to allow stochastic guided exploration of the search space. Experimental results show not only the viability of the method but also its ability to achieve good approximation of the Pareto Front when applied on the multi-objective knapsack problem.

[1]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[2]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  PingSun Leung,et al.  Multiple-criteria decision-making (MCDM) applications in fishery management , 2006 .

[4]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[5]  Ajit Narayanan,et al.  Quantum-inspired genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[6]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[7]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[8]  Tomoyuki Hiroyasu,et al.  SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 , 2004, PPSN.

[9]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[10]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[11]  Colin P. Williams,et al.  Explorations in quantum computing , 1997 .

[12]  Lino A. Costa,et al.  An elitist genetic algorithm for multiobjective optimization , 2004 .

[13]  C. Coello,et al.  Multiobjective optimization using a micro-genetic algorithm , 2001 .

[14]  Carlos A. Coello Coello,et al.  Solving Multiobjective Optimization Problems Using an Artificial Immune System , 2005, Genetic Programming and Evolvable Machines.

[15]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithms with a new termination criterion, H/sub /spl epsi// gate, and two-phase scheme , 2004, IEEE Transactions on Evolutionary Computation.

[16]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[17]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..