Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem
暂无分享,去创建一个
[1] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[2] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[3] Laabadi Soukaina,et al. A hybrid genetic algorithm for solving 0/1 Knapsack Problem , 2018 .
[4] Simon Parsons. Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 305 pp, ISBN 0-262-04219-3 , 2005, Knowl. Eng. Rev..
[5] Jianhua Wu,et al. Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..
[6] Xin-She Yang,et al. Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).
[7] Maoguo Gong,et al. Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.
[8] Husheng Wu,et al. Wolf Pack Algorithm for Unconstrained Global Optimization , 2014 .
[9] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[10] Jens Gottlieb. Evolutionary Algorithms for Multidimensional Knapsack Problems: the Relevance of the Boundary f the Feasible Region , 1999, GECCO.