Combining multiple representations in a genetic algorithm for the multiple Knapsack problem

Authors:
Alex S. Fukunaga;Satoshi Tazoe
Affiliations:
Global Edge Institute, Tokyo Institute of Technology, Meguro, Tokyo, Japan;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, Japan
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 9
Cited 1

The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
The multiple container packing problem: a genetic algorithm approach with weighted codings

ACM SIGAPP Applied Computing Review
Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand

Electronic Commerce Research
Genetic Algorithms for the Multiple Container Packing Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A new representation and operators for genetic algorithms applied to grouping problems

Evolutionary Computation
Bin completion algorithms for multicontainer packing, knapsack, and covering problems

Journal of Artificial Intelligence Research

Improved swap heuristic for the multiple knapsack problem

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new evolutionary algorithm for the multiple knapsack problem (MKP) which uses multiple representations. Previous, successful approaches for the MKP have included a weight-coded, order-based representation, as well as a grouping representation enhanced by a dominance condition to restrict search. We propose a representation-switching genetic algorithm which periodically transforms the representation of individuals between these two representations. We show that this new hybrid algorithm outperforms the previous approaches.