Local Search Heuristic for Multiple Knapsack Problem
Open Access
- 26 January 2015
- journal article
- Published by Science Publishing Group in International Journal of Intelligent Information Systems
- Vol. 4 (2) , 35-39
Abstract
In this paper we will present a heuristic method to solve the Multiple Knapsack Problem. The proposed method is an improvement of the IRT heuristic described in [2].the experimental study shows that our improvement leads some gain in time and solution quality against IRT, MTHM, Mulknap and ILOG CPLEX.Keywords
This publication has 15 references indexed in Scilit:
- A procedure-based heuristic for 0-1 Multiple Knapsack ProblemsInternational Journal of Mathematics in Operational Research, 2012
- A branch-and-bound algorithm for hard multiple knapsack problemsAnnals of Operations Research, 2009
- Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering ProblemsJournal of Artificial Intelligence Research, 2007
- An exact algorithm for large multiple knapsack problemsEuropean Journal of Operational Research, 1999
- A hybrid grouping genetic algorithm for bin packingJournal of Heuristics, 1996
- Knapsack Problems: Algorithms and Computer ImplementationsJournal of the Operational Research Society, 1991
- A Bound and Bound algorithm for the zero-one multiple knapsack problemDiscrete Applied Mathematics, 1981
- Heuristic algorithms for the multiple knapsack problemComputing, 1981
- Solution of the zero-one multiple knapsack problemEuropean Journal of Operational Research, 1980
- An algorithm for 0‐1 multiple‐knapsack problemsNaval Research Logistics Quarterly, 1978