An Approximation Algorithm for Maximizing Product Modularity

Fang Liu, Shaofeng Du, Zhenjun Hong, Yanzhao Wu, Feng Wang, Yong Yin, Dongni Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2020 6th International Conference on Control, Automation and Robotics, ICCAR 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages513-518
Number of pages6
ISBN (Electronic)9781728161396
DOIs
Publication statusPublished - Apr 2020
Event6th International Conference on Control, Automation and Robotics, ICCAR 2020 - Singapore, Singapore
Duration: 20 Apr 202023 Apr 2020

Publication series

Name2020 6th International Conference on Control, Automation and Robotics, ICCAR 2020

Conference

Conference6th International Conference on Control, Automation and Robotics, ICCAR 2020
Country/TerritorySingapore
CitySingapore
Period20/04/2023/04/20

Keywords

  • approximation algorithm
  • product design
  • product modularity
  • semidefinite programming

Fingerprint

Dive into the research topics of 'An Approximation Algorithm for Maximizing Product Modularity'. Together they form a unique fingerprint.

Cite this