Sciweavers

415 search results - page 2 / 83
» Evolving heuristics with genetic programming
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
EPS
1998
Springer
13 years 11 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
EUROGP
2006
Springer
135views Optimization» more  EUROGP 2006»
13 years 11 months ago
Dynamic Scheduling with Genetic Programming
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
Domagoj Jakobovic, Leo Budin
CEC
2007
IEEE
14 years 1 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke