Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 18, Issue 2, Pages 233-247Publisher
SPRINGER
DOI: 10.1007/s10845-007-0019-7
Keywords
product family; configuration design; product variety; genetic algorithm; constraint handling
Ask authors/readers for more resources
Product family design (PFD) has been well recognized as an effective means to satisfy diverse market niches while maintaining the economies of scale and scope. PFD essentially entails a configuration problem by combination, where combinatorial explosion always occurs and is known to be mathematically intractable or NP- hard. Although genetic algorithms (GAs) have been proven to excel in solving combinatorial optimization problems, it is difficult to adopt the traditional GA to deal with the complex data and interrelationships inherent in the PFD problem. This paper proposes a generic genetic algorithm (GGA) for PFD. A generic encoding scheme is developed to adapt to diverse PFD scenarios. A hybrid constraint-handling strategy is proposed to handle complex and distinguishing constraints at different stages along the evolutionary process. The design and implementation procedures of the GGA are discussed in detail. An application of the proposed GGA to motor family design is reported. The GGA efficiency is also tested through efficiency analysis in terms of the probability of generating feasible solutions, as well as through analysis of the GGA complexity.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available