Robust efficiency measures for linear knapsack problem variants

Christopher Wishon, Jesus Villalobos

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Numerous combinatorial optimization applications, such as the mobile retailer product mix problem, utilize the multidemand, multidimensional knapsack problem variant in which there are multiple knapsack constraints requiring a weighted summation of the variables to be less than or equal to a nonnegative value and multiple demand constraints requiring a weighted summation of the variables to be greater than or equal to a nonnegative value. The purpose of this paper is to demonstrate that core variables and efficiency measures, concepts used in the most efficient solvers to-date for binary knapsack problems and some of its variants, can be extended to the multidemand, multidimensional knapsack problem variant. Specifically, new efficiency measure calculations are provided and their properties are mathematically proven and experimentally demonstrated. The contribution of such measures to knapsack problem research is that these measures are applicable to all knapsack problem variants with a single linear objective function and linear constraints of any quantity. The applicability of these new measures is demonstrated through the development of three heuristic procedures: a Fixed-Core heuristic, a Genetic Algorithm, and a Kernel Search heuristic. The results from these tests are compared with the results from a commercial solver and an existing heuristic. The findings from these tests demonstrate that the Fixed-Core and Kernel Search heuristics developed for this paper are the most efficient solvers to-date for hard multidemand, multidimensional knapsack problems.

Original languageEnglish (US)
JournalEuropean Journal of Operational Research
DOIs
StateAccepted/In press - Jun 29 2015

Fingerprint

Knapsack Problem
Multidimensional Knapsack Problem
Combinatorial optimization
Heuristic Search
Heuristics
Summation
Genetic algorithms
Non-negative
kernel
Knapsack
Combinatorial Optimization
Less than or equal to
Linear Constraints
Linear Function
Demonstrate
Objective function
Knapsack problem
Efficiency measures
Genetic Algorithm
Binary

Keywords

  • Combinatorial optimization
  • Genetic Algorithm
  • Heuristic
  • Knapsack problem

ASJC Scopus subject areas

  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Robust efficiency measures for linear knapsack problem variants. / Wishon, Christopher; Villalobos, Jesus.

In: European Journal of Operational Research, 29.06.2015.

Research output: Contribution to journalArticle

@article{301e592b67054bb884b75383db9a6e9f,
title = "Robust efficiency measures for linear knapsack problem variants",
abstract = "Numerous combinatorial optimization applications, such as the mobile retailer product mix problem, utilize the multidemand, multidimensional knapsack problem variant in which there are multiple knapsack constraints requiring a weighted summation of the variables to be less than or equal to a nonnegative value and multiple demand constraints requiring a weighted summation of the variables to be greater than or equal to a nonnegative value. The purpose of this paper is to demonstrate that core variables and efficiency measures, concepts used in the most efficient solvers to-date for binary knapsack problems and some of its variants, can be extended to the multidemand, multidimensional knapsack problem variant. Specifically, new efficiency measure calculations are provided and their properties are mathematically proven and experimentally demonstrated. The contribution of such measures to knapsack problem research is that these measures are applicable to all knapsack problem variants with a single linear objective function and linear constraints of any quantity. The applicability of these new measures is demonstrated through the development of three heuristic procedures: a Fixed-Core heuristic, a Genetic Algorithm, and a Kernel Search heuristic. The results from these tests are compared with the results from a commercial solver and an existing heuristic. The findings from these tests demonstrate that the Fixed-Core and Kernel Search heuristics developed for this paper are the most efficient solvers to-date for hard multidemand, multidimensional knapsack problems.",
keywords = "Combinatorial optimization, Genetic Algorithm, Heuristic, Knapsack problem",
author = "Christopher Wishon and Jesus Villalobos",
year = "2015",
month = "6",
day = "29",
doi = "10.1016/j.ejor.2016.04.025",
language = "English (US)",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",

}

TY - JOUR

T1 - Robust efficiency measures for linear knapsack problem variants

AU - Wishon, Christopher

AU - Villalobos, Jesus

PY - 2015/6/29

Y1 - 2015/6/29

N2 - Numerous combinatorial optimization applications, such as the mobile retailer product mix problem, utilize the multidemand, multidimensional knapsack problem variant in which there are multiple knapsack constraints requiring a weighted summation of the variables to be less than or equal to a nonnegative value and multiple demand constraints requiring a weighted summation of the variables to be greater than or equal to a nonnegative value. The purpose of this paper is to demonstrate that core variables and efficiency measures, concepts used in the most efficient solvers to-date for binary knapsack problems and some of its variants, can be extended to the multidemand, multidimensional knapsack problem variant. Specifically, new efficiency measure calculations are provided and their properties are mathematically proven and experimentally demonstrated. The contribution of such measures to knapsack problem research is that these measures are applicable to all knapsack problem variants with a single linear objective function and linear constraints of any quantity. The applicability of these new measures is demonstrated through the development of three heuristic procedures: a Fixed-Core heuristic, a Genetic Algorithm, and a Kernel Search heuristic. The results from these tests are compared with the results from a commercial solver and an existing heuristic. The findings from these tests demonstrate that the Fixed-Core and Kernel Search heuristics developed for this paper are the most efficient solvers to-date for hard multidemand, multidimensional knapsack problems.

AB - Numerous combinatorial optimization applications, such as the mobile retailer product mix problem, utilize the multidemand, multidimensional knapsack problem variant in which there are multiple knapsack constraints requiring a weighted summation of the variables to be less than or equal to a nonnegative value and multiple demand constraints requiring a weighted summation of the variables to be greater than or equal to a nonnegative value. The purpose of this paper is to demonstrate that core variables and efficiency measures, concepts used in the most efficient solvers to-date for binary knapsack problems and some of its variants, can be extended to the multidemand, multidimensional knapsack problem variant. Specifically, new efficiency measure calculations are provided and their properties are mathematically proven and experimentally demonstrated. The contribution of such measures to knapsack problem research is that these measures are applicable to all knapsack problem variants with a single linear objective function and linear constraints of any quantity. The applicability of these new measures is demonstrated through the development of three heuristic procedures: a Fixed-Core heuristic, a Genetic Algorithm, and a Kernel Search heuristic. The results from these tests are compared with the results from a commercial solver and an existing heuristic. The findings from these tests demonstrate that the Fixed-Core and Kernel Search heuristics developed for this paper are the most efficient solvers to-date for hard multidemand, multidimensional knapsack problems.

KW - Combinatorial optimization

KW - Genetic Algorithm

KW - Heuristic

KW - Knapsack problem

UR - http://www.scopus.com/inward/record.url?scp=84992303407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84992303407&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2016.04.025

DO - 10.1016/j.ejor.2016.04.025

M3 - Article

AN - SCOPUS:84992303407

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

ER -