Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem

Abdelkader Sbihi ()

Journal of the Operational Research Society, 2013, vol. 64, issue 10, 1461-1473

Abstract: In this paper, we develop a perturbed reactive-based neighbourhood search algorithm for the expanding constraint multiple-choice knapsack problem. It combines reactive tabu search with some specific neighbourhood search strategies to approximately solve the problem. The tests were conducted on randomly generated instances and executed in comparable benchmark scenarios to those of the literature. The results outperform those of the Cplex solver and demonstrate the high quality of the two approach versions.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v64/n10/pdf/jors2012130a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v64/n10/full/jors2012130a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:64:y:2013:i:10:p:1461-1473

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().