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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gorman MF, Ahire S (2006) A major appliance manufacturer rethinks its inventory policies for service vehicles. Interfaces 36:407–419
Hanafi S, Freville A (1998) An efficient tabu search approach for the 0–1 multidimensional knapsack problem. Eur J Oper Res 106:663–679
Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin
Li KS, Jia YZ, Zhang WS (2009) Genetic algorithm with schema replaced for solving 0–1 knapsack problem. Appl Res Comput 26:470–471
Liao CX, Li XS, Zhang P, Zhang Y (2011) Improved ant colony algorithm base on normal distribution for knapsack problem. J Syst Simul 23:1156–1160
Martello S, Pisinger D, Toth D (2000) New trends in exact algorithms for the 0–1 knapsack problem. Eur J Oper Res 123:325–332
Papadimitriou HC (1981) On the complexity of integer programming. J ACM 28:765–768
Pisinger D (1995) An expanding-core algorithm for the exact 0–1 knapsack problem. Eur J Oper Res 87:175–187
Shan XJ, Wu SP (2010) Solving 0–1 knapsack problems with genetic algorithm based on greedy strategy. Comput Appl Softw 27:238–239
Tian JL, Chao XP (2011) Novel chaos genetic algorithm for solving 0–1 knapsack problem. Appl Res Comput 28:2838–2839
Zhao XC, Han Y, Ai WB (2011) Improved genetic algorithm for knapsack problem. Comput Eng Appl 47:34–36
Acknowledgments
This research is supported by the Science and Technology Project of the Education Bureau of Fujian, China, under Grant JA11201.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, G. (2013). A Multistart Local Search Heuristic for Knapsack Problem. In: Qi, E., Shen, J., Dou, R. (eds) The 19th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38391-5_101
Download citation
DOI: https://doi.org/10.1007/978-3-642-38391-5_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38390-8
Online ISBN: 978-3-642-38391-5
eBook Packages: Business and EconomicsBusiness and Management (R0)