A diversity reserved quantum particle swarm optimization algorithm for MMKP

Abstract

As a variant of the classical knapsack problem, the multi-dimension multi-choice knapsack problem (MMKP) is widely used in practical applications. It is a NP-complete problem, the exact solution of MMKP cannot be founded in polynomial-time. As one of the heuristic algorithms, quantum particle swarm optimization (QPSO) algorithm provides a sight to get the… (More)
DOI: 10.1109/ICIS.2016.7550941

5 Figures and Tables

Topics

  • Presentations referencing similar topics