IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_8.html
   My bibliography  Save this book chapter

Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem

In: Operations Research Proceedings 2015

Author

Listed:
  • Torsten Buchwald

    (Dresden University of Technology)

  • Guntram Scheithauer

    (Dresden University of Technology)

Abstract

We present a new approach to create instances with large performance ratio, i.e., worst-case instances, of common heuristics for the two-dimensional Strip Packing Problem. The idea of this new approach is to optimise the width and the height of all items aiming to find an instance with maximal performance ratio with respect to the considered heuristic. Therefore, we model the pattern obtained by the heuristic as a solution of an ILP problem and merge this model with a Padberg-type model of the two-dimensional Strip Packing Problem. In fact, the composed model allows to compute the absolute worst-case performance ratio of the heuristic with respect to a limited number of items. We apply the new approach for the Next-Fit Decreasing-Height, the First-Fit Decreasing-Height, and the Best-Fit Decreasing-Height heuristic. Furthermore, we provide an opportunity to use this idea to create worst-case instances for lower bounds.

Suggested Citation

  • Torsten Buchwald & Guntram Scheithauer, 2017. "Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 55-61, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_8
    DOI: 10.1007/978-3-319-42902-1_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-42902-1_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.