Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
<p dir="ltr">In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a population-based matheuristic approach. Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2024
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513510193496064 |
|---|---|
| author | Raka Jovanovic (17947838) |
| author2 | Stefan Voß (6943367) |
| author2_role | author |
| author_facet | Raka Jovanovic (17947838) Stefan Voß (6943367) |
| author_role | author |
| dc.creator.none.fl_str_mv | Raka Jovanovic (17947838) Stefan Voß (6943367) |
| dc.date.none.fl_str_mv | 2024-02-12T09:00:00Z |
| dc.identifier.none.fl_str_mv | 10.1007/s00291-024-00746-2 |
| dc.relation.none.fl_str_mv | https://figshare.com/articles/journal_contribution/Matheuristic_fixed_set_search_applied_to_the_multidimensional_knapsack_problem_and_the_knapsack_problem_with_forfeit_sets/26392816 |
| dc.rights.none.fl_str_mv | CC BY 4.0 info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Information and computing sciences Artificial intelligence Mathematical sciences Applied mathematics Metaheuristics Multidimensional knapsack problem Knapsack problem with forfeit sets Fixed set search Matheuristic |
| dc.title.none.fl_str_mv | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| dc.type.none.fl_str_mv | Text Journal contribution info:eu-repo/semantics/publishedVersion text contribution to journal |
| description | <p dir="ltr">In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a population-based matheuristic approach. Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic is combined with the use of integer programming for solving subproblems. This is achieved by introducing a new ground set of elements that can be used for both the MKP and the KPFS that aim to maximize the information provided by the fixed set. The method for creating fixed sets is also adjusted to enhance the diversity of generated solutions. Compared to state-of-the-art methods for the MKP and the KPFS, the proposed approach offers an implementation that can be easily extended to other variants of the knapsack problem. Computational experiments indicate that the matheuristic FSS is highly competitive to best-performing methods from the literature. The proposed approach is robust in the sense of having a good performance for a wide range of parameter values of the method.</p><h2>Other Information</h2><p dir="ltr">Published in: OR Spectrum<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s00291-024-00746-2" target="_blank">https://dx.doi.org/10.1007/s00291-024-00746-2</a></p> |
| eu_rights_str_mv | openAccess |
| id | Manara2_07118210a4f9e78c34bcb564efa81b4a |
| identifier_str_mv | 10.1007/s00291-024-00746-2 |
| network_acronym_str | Manara2 |
| network_name_str | Manara2 |
| oai_identifier_str | oai:figshare.com:article/26392816 |
| publishDate | 2024 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | CC BY 4.0 |
| spelling | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit setsRaka Jovanovic (17947838)Stefan Voß (6943367)Information and computing sciencesArtificial intelligenceMathematical sciencesApplied mathematicsMetaheuristicsMultidimensional knapsack problemKnapsack problem with forfeit setsFixed set searchMatheuristic<p dir="ltr">In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a population-based matheuristic approach. Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic is combined with the use of integer programming for solving subproblems. This is achieved by introducing a new ground set of elements that can be used for both the MKP and the KPFS that aim to maximize the information provided by the fixed set. The method for creating fixed sets is also adjusted to enhance the diversity of generated solutions. Compared to state-of-the-art methods for the MKP and the KPFS, the proposed approach offers an implementation that can be easily extended to other variants of the knapsack problem. Computational experiments indicate that the matheuristic FSS is highly competitive to best-performing methods from the literature. The proposed approach is robust in the sense of having a good performance for a wide range of parameter values of the method.</p><h2>Other Information</h2><p dir="ltr">Published in: OR Spectrum<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s00291-024-00746-2" target="_blank">https://dx.doi.org/10.1007/s00291-024-00746-2</a></p>2024-02-12T09:00:00ZTextJournal contributioninfo:eu-repo/semantics/publishedVersiontextcontribution to journal10.1007/s00291-024-00746-2https://figshare.com/articles/journal_contribution/Matheuristic_fixed_set_search_applied_to_the_multidimensional_knapsack_problem_and_the_knapsack_problem_with_forfeit_sets/26392816CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/263928162024-02-12T09:00:00Z |
| spellingShingle | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets Raka Jovanovic (17947838) Information and computing sciences Artificial intelligence Mathematical sciences Applied mathematics Metaheuristics Multidimensional knapsack problem Knapsack problem with forfeit sets Fixed set search Matheuristic |
| status_str | publishedVersion |
| title | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| title_full | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| title_fullStr | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| title_full_unstemmed | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| title_short | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| title_sort | Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets |
| topic | Information and computing sciences Artificial intelligence Mathematical sciences Applied mathematics Metaheuristics Multidimensional knapsack problem Knapsack problem with forfeit sets Fixed set search Matheuristic |