A hybrid approach for the 0-1 multidimensional knapsack problem

Authors:
Michel Vasquez;Jin-Kao Hao
Affiliations:
EMA, EERIE, Nimes cedex 1;Université d'Angers, Angers cedex 1
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 4
Cited 29

A simulated annealing approach to the multiconstraint zero-one knapsack problem

Computing
Dynamic tabu list management using the reverse elimination method

Annals of Operations Research - Special issue on Tabu search
Tabu Search

Tabu Search
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics

An evolutionary lagrangian method for the 0/1 multiple knapsack problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
Efficient bulk insertion into a distributed ordered table

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The core concept for 0/1 integer programming

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Journal of Heuristics
Best-First AND/OR Search for 0/1 Integer Programming

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Recent Hybrid Techniques for the Multi-Knapsack Problem

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

Computers and Operations Research
Extremal Optimisation with a Penalty Approach for the Multidimensional Knapsack Problem

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Cheating for problem solving: a genetic algorithm with social interactions

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Local search starting from an LP solution: Fast and quite good

Journal of Experimental Algorithmics (JEA)
A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem

Computers and Operations Research
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem

Discrete Applied Mathematics
An ant colony optimization approach for the multidimensional knapsack problem

Journal of Heuristics
Combinations of local search and exact algorithms

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Computing surrogate constraints for multidimensional Knapsack problems using evolution strategies

Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
The Multidimensional Knapsack Problem: Structure and Algorithms

INFORMS Journal on Computing
Alternating control tree search for knapsack/covering problems

Journal of Heuristics
Smart container loading

Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem

Computers and Operations Research
On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
AND/OR branch-and-bound search for pure 0/1 integer linear programming problems

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Apply the particle swarm optimization to the multidimensional knapsack problem

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
The core concept for the multidimensional knapsack problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem

INFORMS Journal on Computing
Hybrid metaheuristics in combinatorial optimization: a tutorial

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a hybrid approach for the 0-1 multidimensional knapsack problem. The proposed approach combines linear programming and Tabu Search. The resulting algorithm improves significantly on the best known results of a set of more than 150 benchmark instances.