A genetic algorithm for packing in three dimensions
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Scheduling maintenance of electrical power transmission networks using genetic programming
Artificial intelligence techniques in power systems
A Cooperative Coevolutionary Approach to Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A Taxonomy for artificial embryogeny
Artificial Life
Evolutionary Scheduling: A Review
Genetic Programming and Evolvable Machines
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Evolutionary Computation
Continuous Adaptation in Robotic Systems by Indirect Online Evolution
LAB-RS '08 Proceedings of the 2008 ECSIS Symposium on Learning and Adaptive Behaviors for Robotic Systems
Dynamic scheduling with genetic programming
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Evolving accurate and compact classification rules with gene expression programming
IEEE Transactions on Evolutionary Computation
An indirect approach to the three-dimensional multi-pipe routing problem
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
Efficient heuristics are required for on-line optimization problems where search-based methods are unfeasible due to frequent dynamics in the environment. This is especially apparent when operating on combinatorial NP-complete problems involving a large number of items. However, designing new heuristics for these problems may be a difficult and time-consuming task even for domain experts. Therefore, automating this design process may benefit the industry when facing new and difficult optimization problems. The Distributor's Pallet Packing Problem (DPPP) is the problem of loading a pallet of non-homogenous items coming off a production line and is an instance of a range of resource-constrained, NP-complete, scheduling problems that are highly relevant for practical tasks in the industry. Common heuristics for the DPPP typically decompose the problem into two sub-problems; one of pre-scheduling all items on the production line and one of packing the items on the pallet. In this paper we concentrate on a two dimensional version of the DPPP and the more realistic scenario of having knowledge about only a limited set of the items on the production line. This paper aims at demonstrating that such an unknown heuristic may be evolved by Gene Expression Programming and Cooperative Coevolution. By taking advantage of the natural problem decomposition, two species evolve heuristics for pre-scheduling and packing respectively. We also argue that the evolved heuristics form part of a developmental stage in the construction of the finished phenotype, that is, the loaded pallet.