A new graph-theoretic heuristic for facility layout
Management Science
Simulated Annealing and Genetic Algorithms for the Facility LayoutProblem: A Survey
Computational Optimization and Applications
P-Complete Approximation Problems
Journal of the ACM (JACM)
Evolutionary Design by Computers with CDrom
Evolutionary Design by Computers with CDrom
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
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
Solving facility layout problems using genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and 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 |
Several practical problems in industry are difficult to optimize, both in terms of scalability and representation. Heuristics designed by domain experts are frequently applied to such problems. However, designing optimized heuristics can be a non-trivial task. One such difficult problem is the Facility Layout Problem (FLP) which is concerned with the allocation of activities to space. This paper is concerned with the block layout problem, where the activities require a fixed size and shape (modules). This problem is commonly divided into two sub problems; one of creating an initial feasible layout and one of improving the layout by interchanging the location of activities. We investigate how to extract novel heuristics for the FLP by applying an approach called Cooperative Coevolutionary Gene Expression Programming (CCGEP). By taking advantage of the natural problem decomposition, one species evolves heuristics for pre-scheduling, and another for allocating the activities onto the plant. An experimental, comparative approach investigates various features of the CCGEP approach. The results show that the evolved heuristics converge to suboptimal solutions as the problem size grows. However, coevolution has a positive effect on optimization of single problem instances. Expensive fitness evaluations may be limited by evolving generalized heuristics applicable to unseen fitness cases of arbitrary sizes.