2012 | OriginalPaper | Buchkapitel
A New Hybrid Binary Particle Swarm Optimization Algorithm for Multidimensional Knapsack Problem
verfasst von : Amira Gherboudj, Said Labed, Salim Chikhi
Erschienen in: Advances in Computer Science, Engineering & Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we presented a New Hybrid Binary Particle Swarm Optimization (NHBPSO). This hybridization consists at combining some principles of Particle Swarm Optimization (PSO) and Crossover Operation of the Genetic Algorithm (GA). The proposed algorithm is used to solving the NP-hard combinatorial optimization problem of Multidimensional Knapsack Problem (MKP). In the aim to access the efficiency and performance of our NHBPSO algorithm we have tested it on some benchmarks from OR-Library and we have compared our results with the obtained results by the standard binary Particle Swarm Optimization with penalty function technique (PSO-P) algorithm and the quantum version (QICSA) of the new metaheuristic Cuckoo Search. The experimental results show a good and promise solution quality obtained by the proposed algorithm which outperforms the PSO-P and QICSA algorithms.