Sparse, continuous policy representations for uniform online bin packing via regression of interpolants

Swan, Jerry and Drake, John H. and Neumann, Geoff and Özcan, Ender (2017) Sparse, continuous policy representations for uniform online bin packing via regression of interpolants. Lecture Notes in Computer Science, 10197 . pp. 189-200. ISSN 0302-9743

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (230kB) | Preview

Abstract

Online bin packing is a classic optimisation problem, widely tackled by heuristic methods. In addition to human-designed heuristic packing policies (e.g. first- or best- fit), there has been interest over the last decade in the automatic generation of policies. One of the main limitations of some previously-used policy representations is the trade-off between locality and granularity in the associated search space. In this article, we adopt an interpolation-based representation which has the jointly-desirable properties of being sparse and continuous (i.e. exhibits good genotype-to-phenotype locality). In contrast to previous approaches, the policy space is searchable via real-valued optimization methods. Packing policies using five different interpolation methods are comprehensively compared against a range of existing methods from the literature, and it is determined that the proposed method scales to larger instances than those in the literature.

Item Type: Article
Additional Information: 17th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2017), Amsterdam, Netherlands, 19-21 April 2017. The final publication is available at link.springer.com. Drake J.H., Swan J., Neumann G., Özcan E. (2017) Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants. In: Hu B., López-Ibáñez M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017. Lecture Notes in Computer Science, vol 10197, pp. 189-200.
Keywords: Hyper-heuristics, Online Bin Packing, CMA-ES, Heuristic Generation, Sparse Policy Representations, Metaheuristics, Optimisation
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1007/978-3-319-55453-2_13
Depositing User: Ozcan, Dr Ender
Date Deposited: 28 Mar 2017 10:44
Last Modified: 05 May 2017 14:48
URI: http://eprints.nottingham.ac.uk/id/eprint/41569

Actions (Archive Staff Only)

Edit View Edit View