Abstract
Genetic algorithm based strategies for the rapid decomposition of complex, conceptual design spaces into discrete, bounded regions of high performance are described The objective is not to identify single peaks but to identify high performance regions. Sufficient regional cover (in terns of number of solutions) is required for the extraction of infomnation relating to design characteristics to support the designer in decision making processes for the definition of optimal design direction. Three strategies using single population and parallel GA implemertations are described and results are presented An adaptive filter is introduced to eliminate a need for apron knowledge of the design space. Rule-based agents complement the search process by exploring identified regions to define region bounds.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Parmee I. C., Denham M. J. (1994) The Integration of Adaptive Search Techniques with Current Engineering Design Practice. Procs. of Adaptive Computing in Engineering Design and Control; University of Plymouth, UK; Sept. 1994; pp 1–13
Parmee,I. C. (1997) Evolutionary and Adaptive Strategies for Engineering Design-an Overall Framework. IEEE International Conference on Evolutionary Computation, April 13–16, 1997.
Pamee, I. C, (1996) Towards an Optimal Engineering Design Process Using Adaptive Search Strategies. Journal of Engineering Design 7(4). pp 341–362.
Jarvis R A and Patrick, E. A (1993) Clustering using a Similarity Measure Based on Shared Near Neighbours. IEEE Transactions on Computers, (22)11.
Parmee. I. C. (1996) Cluster-Oriented Genetic Algorithms (COGAs) for the Identification of High-Performance Regions of Design Space. Procs. EvCA Conference Moscow. June 24–27 1996
Reeves, C. R (1993) Using Genetic Algorithms with Small Populations. Procs. of the Fifth International Conference on Genetic Algorithms. pp 92–99
Brooker, L. (1987) Improving Search in Genetic Algorithms, In Davis, L. (Ed) Genetic Algorithms and Simulated Annealing pp 61–73. Morgan Kaufmann
Baker, J. E., (1987) Reducing Bias and Inefficiency in the Selection Algorithm. Procs of the Second International Conference on Genetic Algorithms, pp 14–21
Lin, S. C. and Goodman, E. (1994) Coarse-grain parallel genetic algorithms: Categorisation new approach. Sixth IEEE symposium on Parallel and Distributed Processing, Los Alamitos, CA: IEEE Computer Society Press
Syswerda, G. (1989) A study of reproduction in generational and steady state genetic algorithms. In G. Rawlings (Ed.), Foundation of Genetic Algorithms, Morgan Kaufman.
Davidor, Y., Yamada, T. & Nakano, R (1993) The ECOlogical framework II: Improving GA performance at virtually zero cost. Procs of the Fifth International Conference on genetic Algorithms. pp 171–175
Spiessens, P & Manderick, B. (1991) A Massively Parallel Genetic Algorithm: Implementation and First Analysis. Procs. of the Fourth International Conference on Genetic Algorithms. pp 257–263
Beck, M. A. (1996) Parallel Genetic Algorithms: An Investigation of Coarse and Fine Grained approaches to Design Space Decomposition. MSc Thesis. University of Plymouth.
Roy R, Parmee, I. C., Purchase, G. (1996) Integrating the Genetic Algorithm with the Preliminary Design of Gas Turbine Blade Cooling Systems. Procs. of Adaptive Computing in Engineering Design and Control; University of Plymouth, UK; March. 1996.
Parmee. I. C. (1996) The Development of a Dual-Agent Strategy for Efficient Search Across Whole System Engineering Design Hierarchies. Parallel Problem Solving From Nature, Lecture Notes in Computer Science, September 22–27 1996
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parmee, I.C., Beck, M.A. (1997). An evolutionary, agent-assisted strategy for conceptual design space decomposition. In: Corne, D., Shapiro, J.L. (eds) Evolutionary Computing. AISB EC 1997. Lecture Notes in Computer Science, vol 1305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027181
Download citation
DOI: https://doi.org/10.1007/BFb0027181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63476-8
Online ISBN: 978-3-540-69578-3
eBook Packages: Springer Book Archive