scholar.google.com › citations
May 24, 2024 · We apply ACO on Multiple Knapsack Problem (MKP). We have constructed a Local Search (LS) procedure to improve the performance of the algorithm.
In this paper we propose local search procedure, which we combine with a main ACO algorithm. The aim is improvement of the algorithm performance and achievement ...
[PDF] Solving the Multi-dimensional Multi-choice Knapsack Problem ...
shahrear.github.io › iqbal_mmkp
This paper is a first attempt to solve MMKPs using ant colony optimization. Here, we have proposed two new ACO algorithms for solving MMKPs along with a novel ...
In this paper we apply InterCriteria analysis (ICrA) on hybrid Ant Colony Optimization (ACO) algorithm for Multiple Knapsack Problem (MKP).
Abstract— Knapsack problem is an integer programming that is generally called "Multidimentional Knapsack". Knapsack problem is known as a NP-hard problem.
Aug 16, 2024 · Ant Colony Optimization is a stochastic search method that mimics the social behaviour of real ant colonies, which manage to establish the ...
In this paper, we represent a novel ant colony optimization algorithm to solve binary knapsack problem. In the proposed algorithm for n objects, ...
A hybrid metaheuristic is proposed to solve one of the most complex variants of the knapsack problem which is the Strongly Correlated Knapsack Problem (SCKP).
... algorithm combined with a random local search algorithm for guiding ants to a better area of the search space. The two proposed algorithms improve the ...
We present the effect of two different pheromone models for ACO algorithm to tackle the Multiple Knapsack Problem (MKP).
Missing: Procedure | Show results with:Procedure