Title
A Meta-Heuristic And Oscillation Improvement Strategy For The 0-1 Multidimensional Knapsack Problem
Keywords
Meta-heuristics; Multidimensional Knapsack Problem; Optimization
Abstract
This paper presents a solution approach called Meta-RaPS for solving the 0-1 Multidimensional Knapsack Problem. In general, Meta-RaPS constructs and improves feasible solutions at each iteration through the utilization of priority rules used in a randomized fashion. The stage of improvement is based on an oscillation improvement strategy which balances the use of both intensification and diversification procedures. The priority rule used is of dynamic type meaning that penalty factors for each object change their magnitude as the objects are being assigned to the current solution. The paper presents results of this approach and compares with other solution approaches.
Publication Date
12-1-2004
Publication Title
IIE Annual Conference and Exhibition 2004
Number of Pages
325-330
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
30044442105 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/30044442105
STARS Citation
Moraga, Reinaldo J.; Depuy, Gail W.; and Whitehouse, Gary E., "A Meta-Heuristic And Oscillation Improvement Strategy For The 0-1 Multidimensional Knapsack Problem" (2004). Scopus Export 2000s. 4821.
https://stars.library.ucf.edu/scopus2000/4821