Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems

Quadratic Knapsack Problem (QKP), an extension of the canonical simple Knapsack Problem, is NP Hard in the stronger sense. No pseudo-polynomial time algorithm is known to exist which can solve QKP instances. QKP has been studied intensively due to its simple structure yet challenging difficulty and numerous applications. A few attempts have been made to solve large size instances of QKP due to its complexity. Quantum Inspired Evolutionary Algorithm (QIEA) provides a generic framework that has often been carefully tailored for a given problem to obtain an effective implementation. In this work, an improved and parallelized QIEA, dubbed IQIEA-P is presented. Several additional features make it more balanced in exploration and exploitation and thus have better applicability. Computational experiments are presented on large QKP instances of 1000 and 2000 items. The improvements are inherently parallelizable and, therefore, good speedups are obtained on a multi-core machine. No parallel algorithm is available for QKP. The solutions provided by QIEA-P are competitive with those obtained from the state of the art algorithm. (C) 2015 Elsevier B.V. All rights reserved.

[1]  A. Dickson.  On Evolution , 1884, Science.

[2]  Jiming Liu,et al.  A Mini-Swarm for the Quadratic Knapsack Problem , 2007, 2007 IEEE Swarm Intelligence Symposium.

[3]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[4]  Anass Nagih,et al.  Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem , 2012, Comput. Oper. Res..

[5]  Ana Maria A. C. Rocha,et al.  A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems , 2014, J. Comput. Appl. Math..

[6]  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.

[7]  박경철,et al.  An Extended Formulation Approach to the Edge-weighted Maximal Clique Problem , 1995 .

[8]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[9]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[10]  Jong-Hwan Kim,et al.  Parallel quantum-inspired genetic algorithm for combinatorial optimization problem , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[11]  Jong-Hwan Kim,et al.  On setting the parameters of quantum-inspired evolutionary algorithm for practical application , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[12]  Sungsoo Park,et al.  An extended formulation approach to the edge-weighted maximal clique problem , 1996 .

[13]  D. J. Laughhunn.  Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..

[14]  Gexiang Zhang,et al.  Quantum-inspired evolutionary algorithms: a survey and empirical study , 2011, J. Heuristics.

[15]  Chellapilla Patvardhan,et al.  Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem , 2012, Int. J. Math. Oper. Res..

[16]  Pablo Moscato,et al.  Memetic Algorithms , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[17]  Michael Defoin-Platel,et al.  Quantum-Inspired Evolutionary Algorithm: A Multimodel EDA , 2009, IEEE Transactions on Evolutionary Computation.

[18]  Laurence A. Wolsey,et al.  Formulations and valid inequalities for the node capacitated graph partitioning problem , 1996, Math. Program..

[19]  Bryant A. Julstrom.  Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem , 2005, GECCO '05.

[20]  David J. Rader,et al.  Efficient Methods For Solving Quadratic 0–1 Knapsack Problems , 1997 .

[21]  Kay Chen Tan,et al.  A Multi-Facet Survey on Memetic Computation , 2011, IEEE Transactions on Evolutionary Computation.

[22]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[23]  David Pisinger,et al.  The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..

[24]  David Pisinger,et al.  Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction , 2007, INFORMS J. Comput..

[25]  Xin Yao,et al.  Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..

[26]  Chellapilla Patvardhan,et al.  A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions , 2013, SEA.

[27]  Ana Maria A. C. Rocha,et al.  Solving 0–1 quadratic knapsack problems with a population-based artificial fish swarm algorithm , 2012 .

[28]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[29]  Paolo Toth,et al.  Exact Solution of the Quadratic Knapsack Problem , 1999, INFORMS J. Comput..

[30]  Christoph Witzgall.  Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .

[31]  Jong-Hwan Kim,et al.  On the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[32]  Pasquale Arpaia,et al.  A Quantum-inspired Evolutionary Algorithm with a competitive variation operator for Multiple-Fault Diagnosis , 2011, Appl. Soft Comput..

[33]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[34]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[35]  Alok Singh,et al.  An Artificial Bee Colony Algorithm for the Quadratic Knapsack Problem , 2009, ICONIP.

[36]  Alain Billionnet,et al.  An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem , 2004, Eur. J. Oper. Res..

[37]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[38]  Jacek Kucharski,et al.  GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem , 2012 .

[39]  Michael Defoin-Platel,et al.  A versatile quantum-inspired evolutionary algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[40]  Feng Chu,et al.  An effective GRASP and tabu search for the 0-1 quadratic knapsack problem , 2013, Comput. Oper. Res..

[41]  Ana Maria A. C. Rocha,et al.  Solving Multidimensional 0-1 Knapsack Problem with an Artificial Fish Swarm Algorithm , 2012, ICCSA.

[42]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[43]  Ulrich Faigle,et al.  A cutting-plane approach to the edge-weighted maximal clique problem , 1993 .