Modified strip packing heuristics for the rectangular variable-sized bin packing problem | Zendy

FG Ortmann | Zendy; Jan H. van Vuuren | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modified strip packing heuristics for the rectangular variable-sized bin packing problem

Author(s) -

FG Ortmann,

Jan H. van Vuuren

Publication year - 2010

Publication title -

orion/orion

Language(s) - English

Resource type - Journals

eISSN - 2224-0004

pISSN - 0259-191X

DOI - 10.5784/26-1-84

Subject(s) - heuristics , bin packing problem , benchmark (surveying) , packing problems , heuristic , sorting , computer science , bin , mathematical optimization , variable (mathematics) , algorithm , mathematics , mathematical analysis , geodesy , geography

Two packing problems are considered in this paper, namely the well-known strip packing problem (SPP) and the variable-sized bin packing problem (VSBPP). A total of 252 strip packing heuristics (and variations thereof) from the literature, as well as novel heuristics proposed by the authors, are compared statistically by means of 1170 SPP benchmark instances in order to identify the best heuristics in various classes. A combination of new heuristics with a new sorting method yields the best results. These heuristics are combined with a previous heuristic for the VSBPP by the authors to find good feasible solutions to 1357 VSBPP benchmark instances. This is the largest statistical comparison of algorithms for the SPP and the VSBPP to the best knowledge of the authors

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research