poster

Grammar-based Selection Hyper-heuristics for Solving Irregular Bin Packing Problems

Authors:

Alejandro Sosa-Ascencio,

Hugo Terashima-Marín,

José C. Ortiz-Bayliss,

Santiago E. Conant-PablosAuthors Info & Claims

GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion

Pages 111 - 112

https://doi.org/10.1145/2908961.2908970

Published: 20 July 2016 Publication History

Get Access

Abstract

This article describes a grammar-based hyper-heuristic model for selecting heuristics to solve the two-dimensional bin packing problem (2D-PBB) with irregular pieces and regular objects. We propose to use a genetic programming approach to generate rules for selecting one suitable heuristic according to the features that characterize the problem state. The experiments confirm the idea that the results produced by the proposed approach are able to rival those obtained by some heuristics described in the literature.

References

[1]

M. Bader-El-Den and R. Poli. A GP-based hyper-heuristic framework for evolving 3-SAT heuristics. Proceedings of the 9th annual conference on Evolutionary Computation, page 1749, 2007.

Digital Library

Google Scholar

[2]

E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, pages 1--30, 2013.

Crossref

Google Scholar

[3]

E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. Woodward. A classification of hyper-heuristic approaches. In M. Gendreau and J.-Y. Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, pages 449--468. Springer US, 2010.

Google Scholar

[4]

E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward. Automating the packing heuristic design process with genetic programming. Evolutionary Computation, 20(1):63--89, 2012.

Digital Library

Google Scholar

[5]

E. López-Camacho, H. Terashima-Marín, and P. Ross. A hyper-heuristic for solving one and two-dimensional bin packing problems. In 13th annual conference companion on Genetic and evolutionary computation, GECCO '11, pages 257--258, New York, NY, USA, 2011. ACM.

Digital Library

Google Scholar

[6]

E. López-Camacho, H. Terashima-Marín, P. Ross, and G. Ochoa. A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl., 41(15):6876--6889, 2014.

Digital Library

Google Scholar

[7]

P. Ross, J. G. Marín-Blázquez, S. Schulenburg, and E. Hart. Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyper-heuristics. In Conference on Genetic and Evolutionary Computation. Lecture Notes in Computer Science, volume 2724, pages 1295--1306. Springer-Verlag, 2003.

Digital Library

Google Scholar

Cited By

View all

Cellini LMacaluso ALombardi M(2024)QAL-BP: an augmented Lagrangian quantum approach for bin packingScientific Reports10.1038/s41598-023-50540-314:1Online publication date: 1-Mar-2024
https://doi.org/10.1038/s41598-023-50540-3
Ömür Bucak İ(2022)A Heuristically Generated Metric Approach to the Solution of Chase ProblemAutomation and Control - Theories and Applications10.5772/intechopen.101926Online publication date: 25-May-2022
https://doi.org/10.5772/intechopen.101926
Hiruta YNishihara KKoguma YFujii MNakata M(2022)Automatic Construction of Loading Algorithms With Interactive Genetic ProgrammingIEEE Access10.1109/ACCESS.2022.322554310(125167-125180)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3225543
Show More Cited By

Index Terms

Grammar-based Selection Hyper-heuristics for Solving Irregular Bin Packing Problems
1. Computing methodologies
  1. Machine learning
    1. Machine learning approaches
      1. Bio-inspired approaches
        Genetic programming

Recommendations

A hyper-heuristic for solving one and two-dimensional bin packing problems
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation

The idea behind hyper-heuristics is to discover rules that relate different problem states with the best single heuristic to apply. This investigation works towards extending the problem domain in which a given hyper-heuristic can be applied and ...
A comparative study of hyper-heuristics for solving the school timetabling problem
SAICSIT '13: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

Hyper-heuristics have proven to be an effective means of obtaining generalized solutions to optimization problems. One such domain in which they have been a success is educational timetabling. However, all the research in this area has focused on ...
Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation

Generally, we distinguish between two classes of hyper-heuristic approaches, heuristic selection and heuristic generation. The former one works with existing heuristics and tries to find their optimal order for solving the instance. The later approach ...

Comments

Information & Contributors

Information

Published In

GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion

July 2016

1510 pages

ISBN:9781450343237

DOI:10.1145/2908961

Editor:
Tobias Friedrich
Hasso Plattner Institute
,
General Chair:
Frank Neumann
University of Adelaide
,
Program Chair:
Andrew M. Sutton
Hasso Plattner Institute

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.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 2016

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

ITESM Research Group with Strategic Focus in Intelligent Systems
CONACyT Basic Science Project

Conference

GECCO '16

Sponsor:

SIGEVO

GECCO '16: Genetic and Evolutionary Computation Conference

July 20 - 24, 2016

Colorado, Denver, USA

Acceptance Rates

GECCO '16 Companion Paper Acceptance Rate 137 of 381 submissions, 36%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
80
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cellini LMacaluso ALombardi M(2024)QAL-BP: an augmented Lagrangian quantum approach for bin packingScientific Reports10.1038/s41598-023-50540-314:1Online publication date: 1-Mar-2024
https://doi.org/10.1038/s41598-023-50540-3
Ömür Bucak İ(2022)A Heuristically Generated Metric Approach to the Solution of Chase ProblemAutomation and Control - Theories and Applications10.5772/intechopen.101926Online publication date: 25-May-2022
https://doi.org/10.5772/intechopen.101926
Hiruta YNishihara KKoguma YFujii MNakata M(2022)Automatic Construction of Loading Algorithms With Interactive Genetic ProgrammingIEEE Access10.1109/ACCESS.2022.322554310(125167-125180)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3225543
Amaya IOrtiz-Bayliss JConant-Pablos STerashima-Marín HCoello Coello C(2018)Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its SolversParallel Problem Solving from Nature – PPSN XV10.1007/978-3-319-99259-4_30(373-384)Online publication date: 21-Aug-2018
https://doi.org/10.1007/978-3-319-99259-4_30

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A hyper-heuristic for solving one and two-dimensional bin packing problems

A comparative study of hyper-heuristics for solving the school timetabling problem

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations