skip to main content
10.1145/2464576.2464620acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
abstract

Dimension reduction in the search for online bin packing policies

Published: 06 July 2013 Publication History

Abstract

In online bin-packing problems, a policy must be found for assigning items, according their size, immediately upon their arrival to bins with known initial capacities. In previous work of Ozcan and Parkes (GECCO 2011), a policy was represented as a 2-dimensional "matrix" (array) and good matrices were then evolved using a genetic algorithm (GA). Here, we consider a form of dimensional reduction in which variables in the matrix are grouped into elements taken from one-dimensional vectors. We find that with the right form of grouping, the GA then typically finds such "vector policies" significantly more quickly, and yet suffers little loss of overall quality.

Reference

[1]
E. Özcan and A. J. Parkes. Policy matrix evolution for generation of heuristics. In Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pages 2011--2018, New York, NY, USA, 2011. ACM

Cited By

View all
  • (2014)Heuristic generation via parameter tuning for online bin packing2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)10.1109/EALS.2014.7009510(102-108)Online publication date: Dec-2014

Index Terms

  1. Dimension reduction in the search for online bin packing policies

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
    July 2013
    1798 pages
    ISBN:9781450319645
    DOI:10.1145/2464576
    • Editor:
    • Christian Blum,
    • General Chair:
    • Enrique Alba
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 06 July 2013

    Check for updates

    Author Tags

    1. cutting and packing
    2. hyper-heuristic
    3. representations

    Qualifiers

    • Abstract

    Conference

    GECCO '13
    Sponsor:
    GECCO '13: Genetic and Evolutionary Computation Conference
    July 6 - 10, 2013
    Amsterdam, The Netherlands

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2014)Heuristic generation via parameter tuning for online bin packing2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)10.1109/EALS.2014.7009510(102-108)Online publication date: Dec-2014

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media