Solving The 0-1 Multidimensional Knapsack Problem
In: Scopus Export 2000s, 2006
academicJournal
Zugriff:
This paper presents a meta-heuristic solution approach, Meta-RaPS, to 0-1 Multidimensional Knapsack Problem (0-1 MKP). Meta-RaPS (Meta-heuristic for Randomized Priority Search) constructs a feasible solution at each iteration through priority rules used in a randomized fashion to avoid local optimum. After the construction phase, Meta-RaPS improves the solution using a local search technique. The Meta-RaPS 0-1 MKP approach developed herein is tested using a well-known test set of 0-1 MKP problems from the OR-Library. The Meta-RaPS 0-1 MKP results are competitive with the literature findings in terms of time and solution quality.
Titel: |
Solving The 0-1 Multidimensional Knapsack Problem
|
---|---|
Autor/in / Beteiligte Person: | Hepdogan, Seyhun ; Moraga, Reinaldo ; DePuy, Gail W. ; Whitehouse, Gary E. |
Link: | |
Zeitschrift: | Scopus Export 2000s, 2006 |
Veröffentlichung: | STARS, 2006 |
Medientyp: | academicJournal |
Schlagwort: |
|
Sonstiges: |
|