Sciweavers

117 search results - page 16 / 24
» Selfish Bin Packing
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Providing a memory mechanism to enhance the evolutionary design of heuristics
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...
Edmund K. Burke, Matthew R. Hyde, Graham Kendall
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
13 years 7 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
CPAIOR
2009
Springer
14 years 2 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
MFCS
2005
Springer
14 years 1 months ago
Online Interval Coloring with Packing Constraints
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
Leah Epstein, Meital Levy
ANOR
2010
123views more  ANOR 2010»
13 years 7 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria