Adaptive memory search for multidemand multidimensional knapsack problems

Authors:
Halvard Arntzen;Lars M. Hvattum;Arne Løkketangen
Affiliations:
Molde College, Molde, Norway;Molde College, Molde, Norway;Molde College, Molde, Norway
Venue:
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Year:
2006

Citing 3
Cited 6

Tabu Search

Tabu Search
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem

INFORMS Journal on Computing

A tabu search approach for the livestock collection problem

Computers and Operations Research
The importance of being careful

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Black box scatter search for general classes of binary optimization problems

Computers and Operations Research
Alternating control tree search for knapsack/covering problems

Journal of Heuristics
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple adaptive memory search method for the 0/1 Multidemand Multidimensional Knapsack Problem (0/1 MDMKP). The search balances the level of infeasibility against the quality of the solution, and uses a simple dynamic tabu search mechanism. A weighting scheme to balance out the differences in the tightness of the constraints is also implemented. Computational results on a portfolio of test problems taken from the literature are reported, showing very favorable results, both in terms of solution quality and the ability of the search to find feasible solutions.