A Genetic Algorithm for the Multidimensional Knapsack Problem

Authors:
P. C. Chu;J. E. Beasley
Affiliations:
The Management School, Imperial College, London SW7 2AZ, England. E-mail: p.chu@ic.ac.uk, j.beasley@ic.ac.uk;The Management School, Imperial College, London SW7 2AZ, England. E-mail: p.chu@ic.ac.uk, j.beasley@ic.ac.uk
Venue:
Journal of Heuristics
Year:
1998

Citing 25
Cited 118

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

Computing
An approximate algorithm for multidimensional zero-one knapsack problems

Management Science
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
A class of generalized greedy algorithms for the multi-knapsack problem

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Dynamic tabu list management using the reverse elimination method

Annals of Operations Research - Special issue on Tabu search
New optimization heuristics

Journal of Computational Physics
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Optimization by ghost image processes in neural networks

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms

Mathematical Programming: Series A and B
An introduction to genetic algorithms

An introduction to genetic algorithms
A genetic algorithm for the generalised assignment problem

Computers and Operations Research
The zero/one multiple knapsack problem and genetic algorithms

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics
FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete

FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete
A Perspective on Evolutionary Computation

AI '93/AI '94 Selected papers from the AI'93 and AI'94 Workshops on Evolutionary Computation, Process in Evolutionary Computation
Some Guidelines for Genetic Algorithms with Penalty Functions

Proceedings of the 3rd International Conference on Genetic Algorithms
Genetic Optimization Using A Penalty Function

Proceedings of the 5th International Conference on Genetic Algorithms
Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints

Proceedings of the 5th International Conference on Genetic Algorithms
Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The Advantages of Evolutionary Computation

Biocomputing and emergent computation: Proceedings of BCEC97
The growth of multi-constraint random knapsacks with large right-hand sides of the constraints

Operations Research Letters

Permutation-based evolutionary algorithms for multidimensional knapsack problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

Computational Optimization and Applications
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics
An Efficient Algorithm for the Knapsack Sharing Problem

Computational Optimization and Applications
Genetic programming over context-free languages with linear constraints for the knapsack problem: first results

Evolutionary Computation
On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Application of GRASP to the Multiconstraint Knapsack Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Parallel Varying Mutation in Deterministic and Self-adaptive GAs

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Feasibility Restoration for Iterative Meta-heuristics Search Algorithms

IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search

AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
ACO Algorithm for MKP Using Various Heuristic Information

NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
New polynomial-time instances to various knapsack-type problems

Fundamenta Informaticae
Solving the 0/1 knapsack problem using an adaptive genetic algorithm

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
The probe metaheuristic and its application to the multiconstraint knapsack problem

Metaheuristics
Traffic engineering for MPLS-based virtual private networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Securitization of Financial Assets: Approximation in Theory and Practice

Computational Optimization and Applications
An exact algorithm for the knapsack sharing problem

Computers and Operations Research
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
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
Meta-RaPs approach for the 0-1 multidimensional Knapsack problem

Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints

Computers and Operations Research
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem

Journal of Heuristics
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
Hard Problem Generation for MKP

ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

Computational Optimization and Applications
MA|PM: memetic algorithms with population management

Computers and Operations Research
Adaptive memory search for multidemand multidimensional knapsack problems

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A novel approach to optimize clone refactoring activity

Proceedings of the 8th annual conference on Genetic and evolutionary computation
TimeAware test suite prioritization

Proceedings of the 2006 international symposium on Software testing and analysis
Efficient parallel LAN/WAN algorithms for optimization: the MALLBA project

Parallel Computing
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

Computers and Operations Research
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Efficient task replication and management for adaptive fault tolerance in mobile Grid environments

Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem

INFORMS Journal on Computing
A new ant colony optimization algorithm for the multidimensional Knapsack problem

Computers and Operations Research
Workload-based generation of administrator hints for optimizing database storage utilization

ACM Transactions on Storage (TOS)
Computer-based dietary menu planning

EC'06 Proceedings of the 7th WSEAS International Conference on Evolutionary Computing
The core concept for 0/1 integer programming

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Journal of Heuristics
L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Computers and Operations Research
Particle Swarm Optimization for the Multidimensional Knapsack Problem

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems

Applied Soft Computing
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
Efficient allocation and composition of distributed storage

The Journal of Supercomputing
The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: A comparative study

Computers and Operations Research
Cheating for problem solving: a genetic algorithm with social interactions

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An island model for high-dimensional genomes using phylogenetic speciation and species barcoding

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem

Computers and Operations Research
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Resource allocation in an OFDM-based cognitive radio system

IEEE Transactions on Communications
Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem

Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
A global repair operator for capacitated arc routing problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem

Discrete Applied Mathematics
MA|PM: memetic algorithms with population management

Computers and Operations Research
An ant colony optimization approach for the multidimensional knapsack problem

Journal of Heuristics
The property analysis of evolutionary algorithms applied to spanning tree problems

Applied Intelligence
Savings in combinatorial auctions through transformation relationships

TADA/AMEC'06 Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets
Kernel search: A general heuristic for the multi-dimensional knapsack problem

Computers and Operations Research
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
A novel set-based particle swarm optimization method for discrete optimization problems

IEEE Transactions on Evolutionary Computation
The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem

Applied Intelligence
A hybrid evolutionary approach to the nurse Rostering problem

IEEE Transactions on Evolutionary Computation
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs

Discrete Applied Mathematics
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

INFORMS Journal on Computing
Computer-based dietary menu planning: how to support it by complex knowledge?

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
New hybrid matheuristics for solving the multidimensional knapsack problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Journal of Global Optimization
Sampled fictitious play for approximate dynamic programming

Computers and Operations Research
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Computers and Operations Research
Problem reduction heuristic for the 0-1 multidimensional knapsack problem

Computers and Operations Research
A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)

Computers and Operations Research
A new approach to solving 0-1 multiconstraint knapsack problems using attribute grammar with lookahead

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
A novel artificial bee colony algorithm based on attraction pheromone for the multidimensional knapsack problems

AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation

Information Sciences: an International Journal
Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem

Information Sciences: an International Journal
A flipping local search genetic algorithm for the multidimensional 0-1 knapsack problem

CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
A new ant colony optimization applied for the multidimensional knapsack problem

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
An attribute grammar decoder for the 01 multiconstrained knapsack problem

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Computers and Operations Research
An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem

Expert Systems with Applications: An International Journal
Lagrangian relaxation and constraint generation for allocation and advanced scheduling

Computers and Operations Research
Joint robustness and security enhancement for feature-based image watermarking using invariant feature regions

Signal Processing
Introducing a binary ant colony optimization

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
A memetic algorithm for the quadratic multiple container packing problem

Applied Intelligence
Improving an exact approach for solving separable integer quadratic knapsack problems

Journal of Combinatorial Optimization
Solving the hard knapsack problems with a binary particle swarm approach

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound

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
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
An evolutionary strategy for the multidimensional 0-1 knapsack problem based on genetic computation of surrogate multipliers

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
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
A new hybrid algorithm for the multidimensional knapsack problem

ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

Operations Research Letters
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

International Journal of Bio-Inspired Computation
Energy efficient allocation of virtual machines in cloud computing environments based on demand forecast

GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem

INFORMS Journal on Computing
Biogeography based optimization for multi-knapsack problems

ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part I
A differentiating evolutionary computation approach for the multidimensional knapsack problem

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Solving multidimensional 0---1 knapsack problem with an artificial fish swarm algorithm

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
New polynomial-time instances to various knapsack-type problems

Fundamenta Informaticae
A novel modified binary differential evolution algorithm and its applications

Neurocomputing
Machi-POS - point of sales system for restaurant district

International Journal of Knowledge and Web Intelligence
Countering the negative search bias of ant colony optimization in subset selection problems

Computers and Operations Research
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
The influence of linkage-learning in the linkage-tree GA when solving multidimensional knapsack problems

Proceedings of the 15th annual conference on Genetic and evolutionary computation
The importance of the learning conditions in hyper-heuristics

Proceedings of the 15th annual conference on Genetic and evolutionary computation
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems

Journal of Computational and Applied Mathematics
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems

Journal of Global Optimization
Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a heuristic based upon geneticalgorithms for the multidimensional knapsack problem. A heuristicoperator which utilises problem-specific knowledge is incorporatedinto the standard genetic algorithm approach. Computational resultsshow that the genetic algorithm heuristic is capable of obtaininghigh-quality solutions for problems of various characteristics,whilst requiring only a modest amount of computational effort.Computational results also show that the genetic algorithm heuristicgives superior quality solutions to a number of other heuristics.