Skip to main content

Research Repository

Advanced Search

Heuristic generation via parameter tuning for online bin packing

Yarimcam, Ahmet; Asta, Shahriar; Ozcan, Ender; Parkes, Andrew J.

Authors

Ahmet Yarimcam

Shahriar Asta



Abstract

© 2014 IEEE. Online bin packing requires immediate decisions to be made for placing an incoming item one at a time into bins of fixed capacity without causing any overflow. The goal is to maximise the average bin fullness after placement of a long stream of items. A recent work describes an approach for solving this problem based on a 'policy matrix' representation in which each decision option is independently given a value and the highest value option is selected. A policy matrix can also be viewed as a heuristic with many parameters and then the search for a good policy matrix can be treated as a parameter tuning process. In this study, we show that the Irace parameter tuning algorithm produces heuristics which outperform the standard human designed heuristics for various instances of the online bin packing problem.

Start Date Dec 9, 2014
Publication Date Jan 15, 2015
Peer Reviewed Peer Reviewed
Pages 102-108
Book Title 2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)
ISBN 9781479944941
APA6 Citation Yarimcam, A., Asta, S., Ozcan, E., & Parkes, A. J. (2015). Heuristic generation via parameter tuning for online bin packing. In 2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS), (102-108). https://doi.org/10.1109/EALS.2014.7009510
DOI https://doi.org/10.1109/EALS.2014.7009510
Publisher URL http://dx.doi.org/10.1109/EALS.2014.7009510
Copyright Statement Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0
Additional Information Published in: EALS 2014: 2014 IEEE International Symposium on Evolving and Autonomous Learning Systems : proceedings. Piscataway, N.J. : IEEE, c2014, p. 102-108.
ISBN: 9781479944958, doi: 10.1109/EALS.2014.7009510

Files

tuningPolicies.pdf (954 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0





You might also like



Downloadable Citations

;