A faster exact method for large-scale knapsack problems with setup costs and times

Tomiyasu Ichimura, Ryuichi Yokoyama, Hideki Magori

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A class of 0-1 knapsack problems having both setup costs and setup times in the classified item groups is treated. This class emerged relatively newly among many variants of the knapsack problems, and its fast solution methods for the large-scale instances are not yet published to the authors' best knowledge. From this viewpoint, the authors have proposed an extended exact method to tackle the large-scale ones much faster than that of the latest published. The proposed method can solve the instances with 10,000 groups and 1,000,000 items in a few seconds at the best performance. Some computational results are also given.

Original languageEnglish
Pages (from-to)485-504
Number of pages20
JournalInternational Journal of Operational Research
Volume14
Issue number4
DOIs
Publication statusPublished - 2012 Jun

Fingerprint

Setup cost
Setup times
Knapsack problem

Keywords

  • 0-1 knapsack problem
  • Branch and bound
  • Heuristic
  • Large-scale
  • Pegging
  • Relaxation
  • Setup cost
  • Setup time

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

A faster exact method for large-scale knapsack problems with setup costs and times. / Ichimura, Tomiyasu; Yokoyama, Ryuichi; Magori, Hideki.

In: International Journal of Operational Research, Vol. 14, No. 4, 06.2012, p. 485-504.

Research output: Contribution to journalArticle

Ichimura, Tomiyasu ; Yokoyama, Ryuichi ; Magori, Hideki. / A faster exact method for large-scale knapsack problems with setup costs and times. In: International Journal of Operational Research. 2012 ; Vol. 14, No. 4. pp. 485-504.
@article{60afcbe03ec443c39ffd28ca122e61c5,
title = "A faster exact method for large-scale knapsack problems with setup costs and times",
abstract = "A class of 0-1 knapsack problems having both setup costs and setup times in the classified item groups is treated. This class emerged relatively newly among many variants of the knapsack problems, and its fast solution methods for the large-scale instances are not yet published to the authors' best knowledge. From this viewpoint, the authors have proposed an extended exact method to tackle the large-scale ones much faster than that of the latest published. The proposed method can solve the instances with 10,000 groups and 1,000,000 items in a few seconds at the best performance. Some computational results are also given.",
keywords = "0-1 knapsack problem, Branch and bound, Heuristic, Large-scale, Pegging, Relaxation, Setup cost, Setup time",
author = "Tomiyasu Ichimura and Ryuichi Yokoyama and Hideki Magori",
year = "2012",
month = "6",
doi = "10.1504/IJOR.2012.047517",
language = "English",
volume = "14",
pages = "485--504",
journal = "International Journal of Operational Research",
issn = "1745-7645",
publisher = "Inderscience Enterprises Ltd",
number = "4",

}

TY - JOUR

T1 - A faster exact method for large-scale knapsack problems with setup costs and times

AU - Ichimura, Tomiyasu

AU - Yokoyama, Ryuichi

AU - Magori, Hideki

PY - 2012/6

Y1 - 2012/6

N2 - A class of 0-1 knapsack problems having both setup costs and setup times in the classified item groups is treated. This class emerged relatively newly among many variants of the knapsack problems, and its fast solution methods for the large-scale instances are not yet published to the authors' best knowledge. From this viewpoint, the authors have proposed an extended exact method to tackle the large-scale ones much faster than that of the latest published. The proposed method can solve the instances with 10,000 groups and 1,000,000 items in a few seconds at the best performance. Some computational results are also given.

AB - A class of 0-1 knapsack problems having both setup costs and setup times in the classified item groups is treated. This class emerged relatively newly among many variants of the knapsack problems, and its fast solution methods for the large-scale instances are not yet published to the authors' best knowledge. From this viewpoint, the authors have proposed an extended exact method to tackle the large-scale ones much faster than that of the latest published. The proposed method can solve the instances with 10,000 groups and 1,000,000 items in a few seconds at the best performance. Some computational results are also given.

KW - 0-1 knapsack problem

KW - Branch and bound

KW - Heuristic

KW - Large-scale

KW - Pegging

KW - Relaxation

KW - Setup cost

KW - Setup time

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

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

U2 - 10.1504/IJOR.2012.047517

DO - 10.1504/IJOR.2012.047517

M3 - Article

VL - 14

SP - 485

EP - 504

JO - International Journal of Operational Research

JF - International Journal of Operational Research

SN - 1745-7645

IS - 4

ER -