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

QR Code

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

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 pr...

Full description

Bibliographic Details
Main Authors:	Swan, Jerry, Drake, John H., Neumann, Geoff, Özcan, Ender
Format:	Article
Published:	Springer Verlag 2017
Subjects:	Hyper-heuristics Online Bin Packing CMA-ES Heuristic Generation Sparse Policy Representations Metaheuristics Optimisation
Online Access:	https://eprints.nottingham.ac.uk/41569/

Similar Items

An iterated multi-stage selection hyper-heuristic
by: Kheiri, Ahmed, et al.
Published: (2016)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

Hyper-heuristics: a survey of the state of the art
by: Burke, Edmund, et al.
Published: (2013)

A multi-objective hyper-heuristic based on choice function
by: Maashi, Mashael, et al.
Published: (2014)

Choice function based hyper-heuristics for multi-objective optimization
by: Özcan, Ender
Published: (2015)

Automating the packing heuristic design process with genetic programming
by: Burke, Edmund K., et al.
Published: (2012)

Discovering beneficial cooperative structures for the automatic construction of heuristics
by: Terrazas, German, et al.
Published: (2010)

Towards the design of heuristics by means of self-assembly
by: Terrazas, German, et al.
Published: (2010)

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget
by: Gümüş, Düriye Betül, et al.
Published: (2016)

Modified choice function heuristic selection for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings
by: Özcan, Ender, et al.
Published: (2016)

Automated generation of constructive ordering heuristics for educational timetabling
by: Pillay, Nelishia, et al.
Published: (2017)

A genetic programming hyper-heuristic for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

Multi-stage hyper-heuristics for optimisation problems
by: Kheiri, Ahmed
Published: (2014)

Crossover control in selection hyper-heuristics: case studies using MKP and HyFlex
by: Drake, John H.
Published: (2014)

A learning automata based multiobjective hyper-heuristic
by: Li, Wenwen, et al.
Published: (2017)

Hyper-heuristics for grouping problems
by: Elhag, Anas
Published: (2015)

Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
by: Asta, Shahriar, et al.
Published: (2016)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

Searching the hyper-heuristic design space
by: Swan, Jerry, et al.
Published: (2014)

Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
by: Wong, Lily
Published: (2009)

Ant algorithm hyperheuristic approaches for scheduling problems
by: O'Brien, Ross
Published: (2008)

Performance comparison of selection hyper-heuristics on new HyFlex domains
by: Almutairi, Alhanof Khalid S
Published: (2015)

Multi-objective evolutionary algorithms and hyper-heuristics for wind farm layout optimisation
by: Li, Wenwen, et al.
Published: (2017)

CHAMP: Creating Heuristics via Many Parameters for online bin packing
by: Asta, Shahriar, et al.
Published: (2016)

Hyper-heuristic approaches to automatically designing heuristics as mutation operators for evolutionary programming on function classes
by: Hong, Libin
Published: (2018)

Multiobjective selection hyper-heuristics using reinforcement learning
by: Li, Wenwen
Published: (2018)

'An Indirect Genetic Algorithm for Set Covering Problems'
by: Aickelin, Uwe
Published: (2002)

An Indirect Genetic Algorithm for Set Covering Problems
by: Aickelin, Uwe
Published: (2002)

Constructing constrained-version of magic squares using selection hyper-heuristics
by: Kheiri, Ahmed, et al.
Published: (2014)

High school timetabling using selection hyperheuristics
by: Nasir Ahmed, Leena Hassan
Published: (2014)

Sparse subspace representation for spectral document clustering
by: Budhaditya, S., et al.
Published: (2012)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing
by: Tyasnurita, Raras, et al.
Published: (2015)

Hybrid heuristic for multi-carrier transportation plans
by: Landa-Silva, Dario, et al.
Published: (2011)

A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming
by: Hong, Libin, et al.
Published: (2017)

A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
by: Burke, Edmund K., et al.
Published: (2010)

A tensor analysis improved genetic algorithm for online bin packing
by: Asta, Shahriar, et al.
Published: (2015)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)