Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization

Ewa M. Bednarczuk (), Ignacy Kaliszewski () and Janusz Miroforidis ()

Operations Research and Decisions, 2024, vol. 34, issue 4, 53-66

Abstract: The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA16 solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack problem but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems as the one used to validate BISSA.

Keywords: multiobjectivization; multiple-choice knapsack problem; Chebyshev scalarization; BISSA algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no4_3.pdf (application/pdf)

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:wut:journl:v:34:y:2024:i:4:p:53-66:id:3

DOI: 10.37190/ord240403

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().