ACM Home Page
Please provide us with feedback. Feedback
Scalability, generalization and coevolution -- experimental comparisons applied to automated facility layout planning
Full text PdfPdf (1.21 MB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 8: generative and developmental systems table of contents
Pages 691-698  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Marcus Furuholmen  Aker Subsea AS, Oslo, Norway
Kyrre Harald Glette  Univeristy of Oslo, Oslo, Norway
Mats Erling Hovin  University of Oslo, Oslo, Norway
Jim Torresen  University of Oslo, Oslo, Norway
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1569997
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
 
6
 
7
Meller, R., Gau, K.: The facility layout problem: Recent and emerging trends and perspectives. Journal of Manufacturing Systems 15(5) (1996) 351--366
 
8
Singh, S., Sharma, R.: A review of different approaches to the facility layout problems. The International Journal of Advanced Manufacturing Technology 30(5) (2006) 425--433
 
9
Michalek, J., Choudhary, R., Papalambros, P.: Architectural Layout Design Optimization. Engineering Optimization 34(5) (2002) 461--484
 
10
 
11
 
12
Liggett, R.: Automated facilities layout: past, present and future. Automation in Construction 9(2) (2000) 197--215
 
13
 
14
Ferreira, C.: Gene Expression Programming: a New Adaptive Algorithm for Solving Problems. Arxiv preprint cs.AI/0102027 (2001).

Collaborative Colleagues:
Marcus Furuholmen: colleagues
Kyrre Harald Glette: colleagues
Mats Erling Hovin: colleagues
Jim Torresen: colleagues