{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:57:59Z","timestamp":1761487079966},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2003,11,7]],"date-time":"2003-11-07T00:00:00Z","timestamp":1068163200000},"content-version":"unspecified","delay-in-days":190,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2003,5]]},"abstract":"<jats:p>This paper presents an approach to the automatic generation of electromechanical engineering designs. We apply messy genetic algorithm (GA) optimization techniques to the evolution of assemblies composed of Lego<jats:sup>TM<\/jats:sup>structures. Each design is represented as a labeled assembly graph and is evaluated based on a set of behavior and structural equations. The initial populations are generated at random, and design candidates for subsequent generations are produced by user-specified selection techniques. Crossovers are applied by using cut and splice operators at the random points of the chromosomes; random mutations are applied to modify the graph with a certain low probability. This cycle continues until a suitable design is found. The research contributions in this work include the development of a new GA encoding scheme for mechanical assemblies (Legos), as well as the creation of selection criteria for this domain. Our eventual goal is to introduce a simulation of electromechanical devices into our evaluation functions. We believe that this research creates a foundation for future work and it will apply GA techniques to the evolution of more complex and realistic electromechanical structures.<\/jats:p>","DOI":"10.1017\/s0890060403172046","type":"journal-article","created":{"date-parts":[[2003,12,12]],"date-time":"2003-12-12T16:08:45Z","timestamp":1071245325000},"page":"155-168","source":"Crossref","is-referenced-by-count":14,"title":["Using assembly representations to enable evolutionary design of Lego structures"],"prefix":"10.1017","volume":"17","author":[{"given":"MAXIM","family":"PEYSAKHOV","sequence":"first","affiliation":[]},{"given":"WILLIAM C.","family":"REGLI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2003,11,7]]},"reference":[{"key":"S0890060403172046_ref027","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0631-9"},{"key":"S0890060403172046_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00390-4"},{"key":"S0890060403172046_ref019","unstructured":"Pollack, J. & Funes, P. (1997).Computer evolution of buildable objects.Fourth European Conf. Artificial Life, pp.358\u2013367."},{"key":"S0890060403172046_ref015","unstructured":"Jones, E. (1999).Genetic design of antennas and electronic circuits.PhD Thesis.Durham, NC:Duke University."},{"key":"S0890060403172046_ref020","unstructured":"Pollack, J. & Funes, P. (1998).Evolutionary body building: Adaptive physical designs for robots.Artificial Life,4,337\u2013357."},{"key":"S0890060403172046_ref006","unstructured":"Goldberg, D. (1989).Genetic Algorithms in Search, Optimization and Machine Learning.Boston:Addison\u2013Wesley."},{"key":"S0890060403172046_ref018","unstructured":"Luke, S. & Spector, L. (1996).Evolving graphs and networks with edge encoding: Preliminaryreport.Late Breaking Papers at the Genetic Programming 1996 Conf., pp.117\u2013124."},{"key":"S0890060403172046_ref013","doi-asserted-by":"publisher","DOI":"10.1115\/1.2828774"},{"key":"S0890060403172046_ref023","doi-asserted-by":"publisher","DOI":"10.1115\/1.2826672"},{"key":"S0890060403172046_ref009","unstructured":"Goldberg, D. , Korb, B. , & Deb, K. (1989).Messy genetic algorithms: Motivation analysis and first results.Complex Systems,3,493\u2013530."},{"key":"S0890060403172046_ref010","unstructured":"Hartley, S. (1998).Concurrent Programming: The Java Programming Language.Oxford, UK:Oxford University Press."},{"key":"S0890060403172046_ref024","doi-asserted-by":"publisher","DOI":"10.1115\/1.1315299"},{"key":"S0890060403172046_ref026","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192167"},{"key":"S0890060403172046_ref004","doi-asserted-by":"publisher","DOI":"10.1071\/BI9570484"},{"key":"S0890060403172046_ref005","doi-asserted-by":"publisher","DOI":"10.1002\/9780470172261"},{"key":"S0890060403172046_ref011","doi-asserted-by":"publisher","DOI":"10.1145\/164360.164400"},{"key":"S0890060403172046_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(95)00059-3"},{"key":"S0890060403172046_ref001","unstructured":"Bentley, P. (1999).Evolutionary Design by Computers.San Francisco, CA:Morgan Kaufmann."},{"key":"S0890060403172046_ref022","doi-asserted-by":"publisher","DOI":"10.1115\/1.2919451"},{"key":"S0890060403172046_ref017","unstructured":"Koza, J. , Bennett, F., III , Bennett, F. , Andre, D. , & Keane, M. (1999).Genetic Programming III: Automatic Programming and AutomaticCircuit Synthesis.San Francisco, CA:Morgan Kaufmann."},{"key":"S0890060403172046_ref021","unstructured":"Pollack, J. , Watson, R. , & Ficici, S. (1999).Embodied evolution: Embodying an evolutionary algorithm in apopulation of robots. In1999 Congress on Evolutionary Computation( Angeline, P. , Michalewicz, Z. , Schoenauer, M. , Yao, X. & Zalzala, A. , Eds.), pp.335\u2013342.Piscataway, NJ:IEEE."},{"key":"S0890060403172046_ref008","unstructured":"Goldberg, D. , Deb, K. , & Korb, B. (1990).Messy genetic algorithms revised: Studies in mixed size and scale.Complex Systems,4,415\u2013444."},{"key":"S0890060403172046_ref002","unstructured":"Chase, S. (1996).Representing designs with logic formulations of spatialrelations. InWorkshop Notes, Visual Reasoning and Interaction in Design, FourthInt. Conf. Artificial Intelligence in Design."},{"key":"S0890060403172046_ref003","unstructured":"Coello, C. , Christiansen, A. , & Aguirre, A. (1997).Automated design of combinational logic circuits using geneticalgorithms.Proc. Int. Conf. Artificial Neural Nets and Genetic Algorithms,ICANNGA'97, pp.335\u2013338."},{"key":"S0890060403172046_ref007","unstructured":"Goldberg, D. , Deb, K. , Kargupta, H. , & Harik, G. (1993)IlliGAL Report No.93004.Rapid, Accurate Optimization of Difficult Problems Using Fast MessyGenetic Algorithms.Urbana, IL:University of Illinois."},{"key":"S0890060403172046_ref016","doi-asserted-by":"publisher","DOI":"10.1145\/267658.267738"},{"key":"S0890060403172046_ref025","doi-asserted-by":"crossref","unstructured":"Schmidt, L. , Shi, H. , & Kerkar, S. (1999).The \u201cGeneration gap\u201d: A CSP approach linking functionto form grammar generation.Proc. DETC99, DETC99\/DTM-048.","DOI":"10.1115\/DETC99\/DTM-8767"}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060403172046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T16:40:33Z","timestamp":1682613633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060403172046\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0890060403172046"],"URL":"https:\/\/doi.org\/10.1017\/s0890060403172046","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}