Multi-Objective Optimization of Product Configuration

Author(s):  
Sisi Xuanyuan ◽  
Zhaoliang Jiang ◽  
Lalit Patil ◽  
Yan Li ◽  
Zhaoqian Li

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.

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Huilan Jiang ◽  
Bingqi Liu ◽  
Yawei Wang ◽  
Shuangqi Zheng

Fast and elitist nondominated sorting generic algorithm (NSGA2) is an improved multiobjective genetic algorithm with good convergence and robustness. The Pareto optimal solution set using NSGA2 has the character of uniform distribution. This paper builds a time-of-use (TOU) pricing mathematical model considering actual constraint conditions and puts forward a new method which realizes multiobjective TOU pricing optimization using NSGA2. A variety of objective TOU pricing schemes can be provided for decision makers compared with traditional method. Furthermore, the multiple attribute decision making theory is applied in processing the Pareto optimal solution set to calculate the optimal compromise price scheme. The simulation results have shown that the TOU pricing scheme determined by the method proposed above can achieve a better effect of clipping the peak load to fill the valley load. Consequently, the study in this paper is innovative and is a successful exploration of coordinating the relation of various objective functions concerned in TOU pricing optimization problem.


2020 ◽  
pp. 105-113
Author(s):  
M. Farsi

The main aim of this research is to present an optimization procedure based on the integration of operability framework and multi-objective optimization concepts to find the single optimal solution of processes. In this regard, the Desired Pareto Index is defined as the ratio of desired Pareto front to the Pareto optimal front as a quantitative criterion to analyze the performance of chemical processes. The Desired Pareto Front is defined as a part of the Pareto front that all outputs are improved compared to the conventional operating condition. To prove the efficiency of proposed optimization method, the operating conditions of ethane cracking process is optimized as a base case. The ethylene and methane production rates are selected as the objectives in the formulated multi-objective optimization problem. Based on the simulation results, applying the obtained operating conditions by the proposed optimization procedure on the ethane cracking process improve ethylene production by about 3% compared to the conventional condition.  


2021 ◽  
pp. 1-21
Author(s):  
Xin Li ◽  
Xiaoli Li ◽  
Kang Wang

The key characteristic of multi-objective evolutionary algorithm is that it can find a good approximate multi-objective optimal solution set when solving multi-objective optimization problems(MOPs). However, most multi-objective evolutionary algorithms perform well on regular multi-objective optimization problems, but their performance on irregular fronts deteriorates. In order to remedy this issue, this paper studies the existing algorithms and proposes a multi-objective evolutionary based on niche selection to deal with irregular Pareto fronts. In this paper, the crowding degree is calculated by the niche method in the process of selecting parents when the non-dominated solutions converge to the first front, which improves the the quality of offspring solutions and which is beneficial to local search. In addition, niche selection is adopted into the process of environmental selection through considering the number and the location of the individuals in its niche radius, which improve the diversity of population. Finally, experimental results on 23 benchmark problems including MaF and IMOP show that the proposed algorithm exhibits better performance than the compared MOEAs.


2010 ◽  
Vol 29-32 ◽  
pp. 2496-2502
Author(s):  
Min Wang ◽  
Jun Tang

The number of base station location impact the network quality of service. A new method is proposed based on immune genetic algorithm for site selection. The mathematical model of multi-objective optimization problem for base station selection and the realization of the process were given. The use of antibody concentration selection ensures the diversity of the antibody and avoiding the premature convergence, and the use of memory cells to store Pareto optimal solution of each generation. A exclusion algorithm of neighboring memory cells on the updating and deleting to ensure that the Pareto optimal solution set of the distribution. The experiments results show that the algorithm can effectively find a number of possible base station and provide a solution for the practical engineering application.


Sign in / Sign up

Export Citation Format

Share Document