Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

DOI10.1007/978-3-319-55453-2_13zbMath1457.90122OpenAlexW2594831561MaRDI QIDQ3304198

John H. Drake, Jerry Swan, Geoff Neumann, Ender Özcan

Publication date: 5 August 2020

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/117962/1/sparse_continuous_policy.pdf

zbMATH Keywords

metaheuristicsoptimisationhyper-heuristicsCMA-ESonline bin packingheuristic generationsparse policy representations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Uses Software

• MersenneTwister
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple on-line bin-packing algorithm
• Robust Locally Weighted Regression and Smoothing Scatterplots
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Mersenne twister
• The One Dimensional Cutting Stock Problem Using Two Objectives

This page was built for publication: Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants