Sign in
Back
Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm
Conference proceeding

Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm

Arij Mkaouar, Skander Htiouech, Habib Chabchoub and IEEE
2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
IEEE Congress on Evolutionary Computation
01/01/2020

Abstract

Computer Science Computer Science, Artificial Intelligence Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Life Sciences & Biomedicine Mathematical & Computational Biology Operations Research & Management Science Science & Technology Technology
The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an NP-hard problem. Many heuristics algorithms have been developed to solve this combinatorial optimization problem. In this work, a new method based on Artificial Bee Colony algorithm (ABC) and surrogate constraint is proposed to solve the MMKP. Experimental results show that this method is competitive with the state-of-the-art approaches.

Metrics

1 Record Views

Details