A weighted set cover problem for product family design to maximize the commonality of products

DS 94: Proceedings of the Design Society: 22nd International Conference on Engineering Design (ICED19)

Year: 2019
Editor: Wartzack, Sandro; Schleich, Benjamin; Gon
Author: Han, Hyeongmin (1); Chang, Sehyun (2); Kim, Harrison (1)
Series: ICED
Institution: University of Illinois at Urbana-Champaign
Section: Product Architecture and Modularization
DOI number: https://doi.org/10.1017/dsi.2019.302
ISSN: 2220-4342


In product family design, the commonality of products and performance are competing objectives when designers build platforms. The commonality makes it efficient to manufacture products while it will cause performance loss of products. In this paper, we assume that performance functions evaluate the performance of a product. Targets of performance functions are set for each product depending on the product?s property. The designs that satisfy the target of performance functions are denoted as ?good? design points. By using ?good? design points, a weighted set cover problem (WSC) is applied to formulate the combinatorial optimization problem, which maximizes the commonality by minimizing the number component attributes. A recursive greedy algorithm is proposed to handle the general cost function in the problem for product family design. The formulation and the algorithm are tested for a linear three-degree-of-freedom (3DOF) model. In numerical experiment, the proposed method determines optimal values of the components which are suspensions, stabilizer bars, and tires in the vehicle model.

Keywords: Product families, Platform strategies, Optimisation


Please sign in to your account

This site uses cookies and other tracking technologies to assist with navigation and your ability to provide feedback, analyse your use of our products and services, assist with our promotional and marketing efforts, and provide content from third parties. Privacy Policy.