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.