Application of GRASP to the Multiconstraint Knapsack Problem

  • Authors:
  • Pierre Chardaire;Geoff P. McKeown;Jameel A. Maki

  • Affiliations:
  • -;-;-

  • Venue:
  • Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.