An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Parallelization Strategies for Ant Colony Optimization
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Measurement of Population Diversity
Selected Papers from the 5th European Conference on Artificial Evolution
ACO Algorithm for MKP Using Various Heuristic Information
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Ant Colony Optimization
Ant colony optimization theory: a survey
Theoretical Computer Science
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
New metaheuristic approaches for the edge-weighted k-cardinality tree problem
Computers and Operations Research
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Ants can solve constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem
Expert Systems with Applications: An International Journal
A modified shuffled frog leaping algorithm with genetic mutation for combinatorial optimization
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Hi-index | 0.01 |
Ant colony optimization is a metaheuristic that has been applied to a variety of combinatorial optimization problems. In this paper, an ant colony optimization approach is proposed to deal with the multidimensional knapsack problem. It is an extension of Max Min Ant System which imposes lower and upper trail limits on pheromone values to avoid stagnation. In order to choose the lower trail limit, we provide a new method which takes into account the influence of heuristic information. Furthermore, a local search procedure is proposed to improve the solutions constructed by ants. Computational experiments on benchmark problems are carried out. The results show that the proposed algorithm can compete efficiently with other promising approaches to the problem.