An Approximation Algorithm for Maximizing Product Modularity

Abstract

A complex product can be described in terms of its product architecture. There are two product architectures: integral and modular. Advantages of modular products have been noted in the literature. Maximizing modularity is a critical issue in modular product design. In this study, a polynomial approximation algorithm with a 0.422 approximation ratio is proposed to find hidden modules. It is observed that better modularity can be achieved when the product is partitioned into 3 to 8 modules. Numerical experiments with applications in the products of bicycle, starter, and fruit chute system are conducted to illustrate the developed algorithm. Performance of the algorithm is demonstrated by comparisons with other well-known algorithms.