Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem

Bahram Alidaee (), Vijay P. Ramalingam (), Haibo Wang () and Bryan Kethley ()
Additional contact information
Bahram Alidaee: The University of Mississippi
Vijay P. Ramalingam: The University of Mississippi
Haibo Wang: Texas A&M International University
Bryan Kethley: Middle Tennessee State University

Annals of Operations Research, 2018, vol. 269, issue 1, No 2, 3-19

Abstract: Abstract In this paper, we propose a critical event tabu search meta-heuristic for the general integer multidimensional knapsack problem (GMDKP). Variations of GMDKP have enormous applications, and often occur as a sub-problem of more general combinatorial problems. For the special case of binary multidimensional knapsack problems (BMDKP) there are variety of heuristics, mostly sophisticated meta-heuristics, which provides good solutions to the problem. However, to date there is no method that can provide reasonable solutions to realistic size GMDKP. To the best of our knowledge there are only three heuristics published in the literature for GMDKP, and all three are simple greedy heuristics. There is no meta-heuristic available that effectively provides good solutions for large-scale GMDKP. One successful meta-heuristic that has proven to be highly effective in solving combinatorial optimization is a variation of tabu search known as the critical event tabu search (CETS). CETS was originally proposed for the BMDKP with considerable success afterwards. In CETS, clever use of surrogate programming is embedded as choice rules to obtain high quality solutions. The main purpose of this paper is to design the meta-heuristic CETS for the GMDKP using variety of different surrogate choice rules. Extensive computational experiment for large-scale problems are presented. Our procedures open the door for further applications of meta-heuristics to general integer programs.

Keywords: Integer programming; Multidimensional knapsack problems; Heuristics (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2675-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:269:y:2018:i:1:d:10.1007_s10479-017-2675-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2675-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().