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

Authors:
V. C. Li;G. L. Curry
Affiliations:
School of Business, Ithaca College, Ithaca, NY;Department of Industrial Engineering Texas A&M University, College Station, TX
Venue:
Computers and Operations Research
Year:
2005

Citing 12
Cited 4

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
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
Hashing vectors for tabu search

Annals of Operations Research - Special issue on Tabu search
Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems

Advances in computational and stochastic optimization, logic programming, and heuristic search
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Tutorial on Surrogate Constraint Approaches for Optimization in Graphs

Journal of Heuristics
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
Towards the real time solution of strike force asset allocation problems

Computers and Operations Research

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

Computers and Operations Research
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Computers and Operations Research
Optimal source-based filtering of malicious traffic

IEEE/ACM Transactions on Networking (TON)
First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

A critical event tabu search method which navigates both sides of the feasibility boundary has been shown effective for solving the multidimensional knapsack problem. In this paper, we apply the method to the multidimensional knapsack problem with generalized upper bound constraints. This paper also demonstrates the merits of using surrogate constraint information vs. a Lagrangian relaxation scheme as choice rules for the problem class. A constraint normalization method is presented to strengthen the surrogate constraint information and improve the computational results. The advantages of intensifying the search at critical solutions are also demonstrated.