Economics at your fingertips  

An iterative algorithm for the Max-Min knapsack problem with multiple scenarios

Thekra Al-douri, Mhand Hifi () and Vassilis Zissimopoulos
Additional contact information
Thekra Al-douri: EPROAD - EA 4669, Université de Picardie Jules Verne
Mhand Hifi: EPROAD - EA 4669, Université de Picardie Jules Verne
Vassilis Zissimopoulos: National and Kapodistrian University of Athens

Operational Research, 2021, vol. 21, issue 2, No 23, 1355-1392

Abstract: Abstract In this paper, we propose to solve the max-min knapsack problem with multiple scenarios by using an iterative algorithm that uses three main phases: (1) construction phase, (2) improvement phase, and (3) destroying/repairing phase. The first phase yields a (starting) pool of elite solutions for the problem by applying a greedy randomized search. The second phase tries to improve each solution at hand by using an intensification search using path-relinking combined with a look-ahead strategy. The third phase can be viewed as a diversification strategy, where the iterative algorithm tries to avoid premature convergence towards local optima. Finally, the proposed method is evaluated on a set of benchmark instances taken from the literature. Its obtained results are compared to those reached by recent algorithms available in the literature. The computational part shows that the method remains competitive (in term of the quality of solutions achieved), where it is able to provide better bounds than those already published ones.

Keywords: Heuristic; Knapsack; Neighborhood; Optimization; Path-relinking (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link) 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:

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-019-00463-7

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

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

Page updated 2021-06-26
Handle: RePEc:spr:operea:v:21:y:2021:i:2:d:10.1007_s12351-019-00463-7