Composition of module stock for final assembly using an enhanced genetic algorithm

The paper focuses on modelling and solving a design problem, namely the selection of a set of modules to be manufactured at one or more distant sites and shipped to a proximity site for final assembly subject to time constraints. The problem is modelled as a mathematical one, and solved by an appropriately designed genetic algorithm enhanced with a modified crossover operation, a uniform mutation with adaptive rate and a partial reshuffling procedure. The actual design problem is solved with 17 components. Larger problems may be solved without modifying the modelling steps, although they may require variation in terms of processing time, depending on the constraints that exist between the components.

[1]  Zahed Siddique,et al.  Product Platform and Product Family Design , 2006 .

[2]  Roger Jianxin Jiao,et al.  Architecture of Product Family: Fundamentals and Methodology , 2001, Concurr. Eng. Res. Appl..

[3]  Olivier Briant,et al.  The Optimal Diversity Management Problem , 2004, Oper. Res..

[4]  Michel Tollenaere,et al.  Modular and platform methods for product family design: literature analysis , 2005, J. Intell. Manuf..

[5]  Alan N Bramley,et al.  Advances in Integrated Design and Manufacturing in Mechanical Engineering , 2006 .

[6]  Bruno Agard,et al.  Design of Wire Harnesses for Mass Customization , 2003 .

[7]  Kathryn E. Stecke,et al.  Least in-sequence probability heuristic for mixed-volume production lines , 2008 .

[8]  M. Howard,et al.  Automotive supplier parks: An imperative for build-to-order? , 2006 .

[9]  Roger Jianxin Jiao,et al.  A methodology of developing product family architecture for mass customization , 1999, J. Intell. Manuf..

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[12]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[13]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[14]  Y. Frein,et al.  Local scheduling problems submitted to global FIFO processing constraints , 2004 .

[15]  S. Kotha.  Mass Customization: The New Frontier in Business Competition , 1992 .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  Dave Alford,et al.  Mass customisation } an automotive perspective , 2000 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Gérard P. Cachon.  Supply Chain Coordination with Contracts , 2003, Supply Chain Management.

[20]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.