Skip to main content

Advertisement

Log in

An integrated ILS-VND strategy for solving the knapsack problem with forfeits

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

A Correction to this article was published on 13 September 2024

This article has been updated

Abstract

This work address a variant of the knapsack problem, known as the knapsack problem with forfeits, which has numerous applications. In this variant, a set of items and a conflict graph are given, and the objective is to identify a collection of items that adhere to the knapsack’s capacity while maximizing the total value of the items minus the penalties for conflicting items. We propose a novel heuristic for this problem based on the concepts of iterated local search, variable neighborhood descent, and tabu search. Our heuristic takes into account four neighborhood structures, and we introduce efficient data structures to explore them. Experimental results demonstrate that our approach outperforms the state-of-the-art algorithms in the literature. In particular, it delivers superior solutions within significantly shorter computation times across all benchmark instances. Additionally, this study includes an analysis of how the proposed data structures have influenced both the quality of the solutions and the execution time of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

The instances and the source code are available at: https://github.com/Sekva/ilsvnd_kpf.

Change history

Notes

  1. https://github.com/Sekva/ilsvnd_kpf

References

Download references

Acknowledgements

We would like to thank Prof. Andrea Raiconi for providing the instances. The authors acknowledge the support from the Coordination for the Improvement of Higher Education Personnel—Brazil (CAPES), the National Council for Scientific and Technological Development—Brazil (CNPq), and the Fundação de Amparo à Pesquisa do Estado de Alagoas (FAPEAL).

Funding

This work was supported by FAPEAL, CNPq, and CAPES.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rian G. S. Pinheiro.

Ethics declarations

Conflict of interest

The authors declare they have no Conflict of interest.

Ethical Approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The original version of the article was revised: The affiliation information for first author has been corrected.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vieira, M.M., Nogueira, B. & Pinheiro, R.G.S. An integrated ILS-VND strategy for solving the knapsack problem with forfeits. J Heuristics 30, 399–420 (2024). https://doi.org/10.1007/s10732-024-09532-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-024-09532-3

Keywords

Navigation