A Multistart Local Search Heuristic for Knapsack Problem

Geng Lin ()
Additional contact information
Geng Lin: Minjiang University

Chapter Chapter 101 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 957-962 from Springer

Abstract: Abstract Knapsack problem is one of classical combinatorial optimization problems, and has a lot of applications. It is known to be NP-hard. In this paper we propose a multistart local search heuristic for solving the knapsack problem. Firstly, knapsack problem is converted into an unconstrained integer programming by penalty method. Then an iterative local search method is presented to solve the resulting unconstrained integer programming. The computational results on three benchmarks show that the proposed algorithm can find high quality solutions in an effective manner.

Keywords: Knapsack problem; Local search; Heuristic (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-642-38391-5_101

Ordering information: This item can be ordered from
http://www.springer.com/9783642383915

DOI: 10.1007/978-3-642-38391-5_101

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().