A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Some Guidelines for Genetic Algorithms with Penalty Functions
Proceedings of the 3rd International Conference on Genetic Algorithms
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Management Science
A Minimal Algorithm for the Bounded Knapsack Problem
INFORMS Journal on Computing
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
Computational Optimization and Applications
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
Computational Optimization and Applications
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem
The Journal of Supercomputing
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Hard multidimensional multiple choice knapsack problems, an empirical study
Computers and Operations Research
A column generation method for the multiple-choice multi-dimensional knapsack problem
Computational Optimization and Applications
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Solving the multi-dimensional multi-choice Knapsack problem with the help of ants
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problems
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Development of core to solve the multidimensional multiple-choice knapsack problem
Computers and Industrial Engineering
Computers and Operations Research
Information Sciences: an International Journal
Computers and Operations Research
A low-overhead heuristic for mixed workload resource partitioning in cluster-based architectures
ARCS'12 Proceedings of the 25th international conference on Architecture of Computing Systems
First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
International Journal of Metaheuristics
A fast and scalable multidimensional multiple-choice knapsack heuristic
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
| Hi-index | 0.00 |
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose an algorithm which is based upon reactive local search and where an explicit check for the repetition of configurations is added to the local search. The algorithm starts by an initial solution and improved by using a fast iterative procedure. Later, both deblocking and degrading procedures are introduced in order (i) to escape to local optima and, (ii) to introduce diversification in the search space. Finally, a memory list is applied in order to forbid the repetition of configurations. The performance of the proposed approaches has been evaluated on several problem instances. Encouraging results have been obtained.