A number of approaches based on GRASP are presented for the Multiconstraint Knapsack Problem. GRASP combines greedy construction of feasible solutions with local search. Results from applying our algorithms to standard test problems are presented and compared with results obtained by Chu and Beasley.
|Title of host publication
|Applications of Evolutionary Computing
|Egbert J. W. Boers
|Number of pages
|Published - 2001
|Lecture Notes in Computer Science