First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem

Authors:
Chaitr S. Hiremath;Raymond R. Hill
Affiliations:
Accenture Services Pvt. Ltd., Infinity Park, Malad East, Mumbai - 400097, India;Air Force Institute of Technology, 2950 Hobson Way, Bld 641, Suite 201, Dayton, OH 45433, USA
Venue:
International Journal of Metaheuristics
Year:
2013

Citing 17
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
The multiple container packing problem: a genetic algorithm approach with weighted codings

ACM SIGAPP Applied Computing Review
Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem

ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Building an Adaptive Multimedia System using the Utility Model

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance

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

Computers and Operations Research
Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints

Computers and Operations Research
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

Computational Optimization and Applications
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

Computers and Operations Research
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

Computers and Operations Research
ASP, The Art and Science of Practice: Appeal to NP-Completeness Considered Harmful: Does the Fact That a Problem Is NP-Complete Tell Us Anything?

Interfaces
Synthetic Optimization Problem Generation: Show Us the Correlations!

INFORMS Journal on Computing
Hard multidimensional multiple choice knapsack problems, an empirical study

Computers and Operations Research
A column generation method for the multiple-choice multi-dimensional knapsack problem

Computational Optimization and Applications
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Computers and Operations Research
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply tabu search to the multiple-choice multidimensional knapsack problem. An initial solution involves a simple greedy heuristic. A neighbourhood is generated and a move is selected based on the best feasible neighbouring solution. The search continues for a fixed number of iterations and tabu search structures are used to improve the search process. We study the problem structure of available, benchmark, test problem instances and develop a new, more diverse set of test problem instances whose results better generalise to practice than do results obtained using existing test problems. We report the results of testing our tabu search approach versus existing solution approaches as applied to the available and our new test problem instances. The computational results show that our proposed approach performs comparably or better than the legacy heuristic approaches and clearly demonstrates that test problems affects how well results generalise to practice.