2008Unpublished venueRequires access

Multi-Objective Optimization of Product Configuration

Sisi Xuanyuan, Zhaoliang Jiang, Lalit Patil, Yan Li, Zhaoqian Li

Open publisher page 14 citations

Abstract

In the context of globalization and mass customization, selecting the appropriate product configuration requires a simultaneous consideration of multiple criteria or objectives, which are in conflict with each other. The large solution space implies that analyzing each feasible solution is a combinatorial problem. Furthermore, no single optimal solution exists; on the contrary, there is a set of valid optimal solutions, i.e., the solution set is Pareto-optimal. We present the configuration problem from the perspective of using two types of attributes: static, i.e., the attributes that have pre-defined and constant values throughout the configuration process, and dynamic, i.e., attributes whose values vary according to decisions that are being made during the configuration process. We pose the product configuration as a multiobjective optimization problem requiring that multiple objective functions cannot be combined into a single objective function. We demonstrate the applicability of using Multi-Objective Genetic Algorithms (MOGA) to solve the problem and converge to a Pareto-optimal solution set from the large number of feasible solutions.

About this research paper

What this paper is about

In the context of globalization and mass customization, selecting the appropriate product configuration requires a simultaneous consideration of multiple criteria or objectives, which are in conflict with each other. The large solution space implies that analyzing each feasible solution is a combinatorial problem. Furthermore, no single optimal solution exists; on the contrary, there is a set of valid optimal solutions, i.e., the solution set is Pareto-optimal. We present the configuration problem from the perspective of using two types of attributes: static, i.e., the attributes that have pre-defined and constant values throughout the configuration process, and dynamic, i.e., attributes whose values vary according to decisions that are being made during the configuration process. We pose the product configuration as a multiobjective optimization problem requiring that multiple objective functions cannot be combined into a single objective function. We demonstrate the applicability of using Multi-Objective Genetic Algorithms (MOGA) to solve the problem and converge to a Pareto-optimal solution set from the large number of feasible solutions.

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In the context of globalization and mass customization, selecting the appropriate product configuration requires a simultaneous consideration of multiple criteria or objectives, which are in conflict with each other. The large solution space implies that analyzing each feasible solution is a combinatorial problem. Furthermore, no single optimal solution exists; on the contrary, there is a set of valid optimal solutions, i.e., the solution set is Pareto-optimal. We present the configuration problem from the perspective of using two types of attributes: static, i.e., the attributes that have pre-defined and constant values throughout the configuration process, and dynamic, i.e., attributes whose values vary according to decisions that are being made during the configuration process. We pose the product configuration as a multiobjective optimization problem requiring that multiple objective functions cannot be combined into a single objective function. We demonstrate the applicability of using Multi-Objective Genetic Algorithms (MOGA) to solve the problem and converge to a Pareto-optimal solution set from the large number of feasible solutions.

Key concepts: Mathematical optimization, Set (abstract data type), Context (archaeology), Multi-objective optimization, Pareto principle, Computer science, Product (mathematics), Solution set

Related papers

Back to paper searchBrowse research topicsOriginal source
Multi-Objective Optimization of Product Configuration — Research Paper | ScholarLens