Title

Solving The 0-1 Multidimensional Knapsack Problem

Keywords

0-1 multidimensional Knapsack problem; Combinatorial optimization; Meta-heuristics

Abstract

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.

Publication Date

12-1-2006

Publication Title

2006 IIE Annual Conference and Exhibition

Number of Pages

-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

36448970154 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/36448970154

This document is currently not available here.

Share

COinS