@article{cormier_p o'grady_sanii_1998, title={A constraint-based genetic algorithm for concurrent engineering}, volume={36}, ISSN={["0020-7543"]}, DOI={10.1080/002075498193228}, abstractNote={Concurrent engineering is a complex problem in that a large number of considerations have to be brought to bear during the design stage. Compounding this complexity is that concurrent engineering problems are also likely to encompass both numeric and symbolic variables, and constraints that range from simple algebraic constraints, through conditional constraints, to potentially very complex database constraints. Previous approaches have concentrated on finding good solutions to simplified problems or, alternatively, to finding a feasible solution which may not be close to optimal. This paper presents an approach to concurrent engineering problems that extends the conventional genetic algorithm approach to handle the complex variety of variables and constraints that are inherent in a typical concurrent engineering problem. This poses some severe research challenges and this paper describes three genetic operators (the constraint-based initialization, crossover, and mutation operators) that preserve feasibi...}, number={6}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, author={Cormier, D and P O'Grady and Sanii, E}, year={1998}, month={Jun}, pages={1679–1697} }