• Title/Summary/Keyword: Pareto Optimal Solution

Search Result 95, Processing Time 0.025 seconds

Design Optimization of Axial Flow Fan Using Genetic Algorithm (유전자 알고리즘을 이용한 축류 송풍기 설계최적화)

  • Lee, Sang-Hwan;Ahn, Cheol-O
    • The KSFM Journal of Fluid Machinery
    • /
    • v.7 no.2 s.23
    • /
    • pp.7-13
    • /
    • 2004
  • In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution agree well to the designer's weighting values, we proposed new multiobjective function which was the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach is effective for the case that the quality of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.

Multi-Criteria Group Decision Making Considering the Willingness to Reject and the Indifferent Preference (거부 및 무차별 선호 조건을 고려한 다기준 그룹 의사결정)

  • Choi, Ji-Yoon;Kim, Jae-Hee;Kim, Sheung-Kown
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.1
    • /
    • pp.57-66
    • /
    • 2012
  • The paper deals with the development of a model for group decision making under multiple criteria. The Multi-criteria group decision making (MCGDM) is the process to determine the best compromise solution in a set of competing alternatives that are evaluated by decision makers having their own preferences on conflicting objectives. For MCGDM, we propose a Mixed-Integer Programming (MIP) model that implements a revised median approach by noticing that the original median approach cannot consider the willingness to reject and the indifferent preference conditions. The proposed MIP model tries to select a common best Pareto-optimal solution by maximizing the overall desirability considering the willingness to reject and the indifferent preference that represent the tolerance measure of each decision maker. To evaluate the effectiveness of the proposed model, we compared the results of the proposed model with those of the median approach. The results showed that the proposed MIP model produces more realistic and better compromised alternative by incorporating the decision maker's willingness to reject and the indifferent preferences over each criteria.

Application of multi-objective genetic algorithm for waste load allocation in a river basin (오염부하량 할당에 있어서 다목적 유전알고리즘의 적용 방법에 관한 연구)

  • Cho, Jae-Heon
    • Journal of Environmental Impact Assessment
    • /
    • v.22 no.6
    • /
    • pp.713-724
    • /
    • 2013
  • In terms of waste load allocation, inequality of waste load discharge must be considered as well as economic aspects such as minimization of waste load abatement. The inequality of waste load discharge between areas was calculated with Gini coefficient and was included as one of the objective functions of the multi-objective waste load allocation. In the past, multi-objective functions were usually weighted and then transformed into a single objective optimization problem. Recently, however, due to the difficulties of applying weighting factors, multi-objective genetic algorithms (GA) that require only one execution for optimization is being developed. This study analyzes multi-objective waste load allocation using NSGA-II-aJG that applies Pareto-dominance theory and it's adaptation of jumping gene. A sensitivity analysis was conducted for the parameters that have significant influence on the solution of multi-objective GA such as population size, crossover probability, mutation probability, length of chromosome, jumping gene probability. Among the five aforementioned parameters, mutation probability turned out to be the most sensitive parameter towards the objective function of minimization of waste load abatement. Spacing and maximum spread are indexes that show the distribution and range of optimum solution, and these two values were the optimum or near optimal values for the selected parameter values to minimize waste load abatement.

Interactive Fuzzy Multiobjective Decision-Making with Imprecise Goals (모호한 목표를 가진 대화형 퍼지 다목적 의사결정)

  • ;;Hong, S. L.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.3
    • /
    • pp.67-78
    • /
    • 1992
  • MODM (multiobjective decision-making) problem is very complex system for the analyst. The problem is more complex if the goals of each of the objective functions are expressed imprecisely. It requires suitable MODM method to deal with imprecisions. Therefore, we present a new interactive fuzzy decision making method for solving multiobjective nonlinear programming problems by assuming that the decision maker (DM) has imprecise goals that assume fuzzy linguistic variable for each of the objective functions. The imprecise goals of the DM are quantified by eliciting corresponding membership functions through the interactive with the DM out of six membership functions. After determining membership functions, in order to generate the compromise or satisficing solution which is .lambda.-pareto optimal, .lambda.-max problem is solved. The higher degree of membership is chosen to satisfy imprecise goals of all objective functions by combining the membership functions. Then, the values are the compromise or satisficing solution. On the basis of the proposed method, and interactive computer programming is written to implement man-machine interactive procedures. Our programming is a revised version of sequential unconstrained minimization technique. Finally, a numerical example illustrates various aspects of the results developed in this paper.

  • PDF

Design Optimization of Axial Flow Fan Using Genetic Algorithm (유전자 알고리즘을 이용한 축류 송풍기 설계최적화)

  • Yoo, In-Tae;Ahn, Cheol-O;Lee, Sang-Hwan
    • 유체기계공업학회:학술대회논문집
    • /
    • 2003.12a
    • /
    • pp.397-403
    • /
    • 2003
  • In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution well agree to the designer's weighting values, we proposed new multiobjective function which is the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach will be effective for the case that the qualify of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.

  • PDF

Quantum Bee Colony Optimization and Non-dominated Sorting Quantum Bee Colony Optimization Based Multi-relay Selection Scheme

  • Ji, Qiang;Zhang, Shifeng;Zhao, Haoguang;Zhang, Tiankui;Cao, Jinlong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4357-4378
    • /
    • 2017
  • In cooperative multi-relay networks, the relay nodes which are selected are very important to the system performance. How to choose the best cooperative relay nodes is an optimization problem. In this paper, multi-relay selection schemes which consider either single objective or multi-objective are proposed based on evolutionary algorithms. Firstly, the single objective optimization problems of multi-relay selection considering signal to noise ratio (SNR) or power efficiency maximization are solved based on the quantum bee colony optimization (QBCO). Then the multi-objective optimization problems of multi-relay selection considering SNR maximization and power consumption minimization (two contradictive objectives) or SNR maximization and power efficiency maximization (also two contradictive objectives) are solved based on non-dominated sorting quantum bee colony optimization (NSQBCO), which can obtain the Pareto front solutions considering two contradictive objectives simultaneously. Simulation results show that QBCO based multi-relay selection schemes have the ability to search global optimal solution compared with other multi-relay selection schemes in literature, while NSQBCO based multi-relay selection schemes can obtain the same Pareto front solutions as exhaustive search when the number of relays is not very large. When the number of relays is very large, exhaustive search cannot be used due to complexity but NSQBCO based multi-relay selection schemes can still be used to solve the problems. All simulation results demonstrate the effectiveness of the proposed schemes.

A Study on the Agency Theory and Accounting (에이전시이론과 회계감사에 관한 연구)

  • 공해영
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.12 no.20
    • /
    • pp.123-138
    • /
    • 1989
  • The primary objective of the agency research in the game theory lives in the maintenance of Pareto is optimal condition for the optimal incentive contract. The basic concepts which are related to this objective are reviewed in connection with the general assumptions to model it, the moral hazard and adverse selection which arised from the information asymmetry, and finally the problem of risk distribution. The demand for auditing and the role of auditor have been addressed by ASOBAC. Issues which an auditor is explicitly introduced in a principal-agent framework have been addressed in this paper. These issues must be confronted to appropriately with the auditor, and to achieve an adequate understanding of optimal confronting arrangement with the auditor. The first step in introducing an auditor into this analysis is to examine the game-theoretic foundation of such a expended agency model. The Mathematical program formulated may not yield solution that are resonable. This arises because the program may call for the auditor and manager to play dominated Nash equilibra in some subgame. The nontrivial natures of the subgame implies that randomized strategies by the auditor and manager nay be of crucial importance. The possibilities for overcoming the randomized strategy problem were suggested; change the rule of the game and or impose covexity condition. The former seems unjustifiable in on auditing context, and the latter promising but difficult to achieve. The discussion ended with an extension of the revelation principle to the owner manager-auditor game, assuming strategies. An examination of the restriction and improvement direction of the basic concept of agency theory was addressed in the later part of this paper. Many important aspects of auditor incentives are inherently multiple-agent, multiple-period, multiple-objectine, phenomena and require further analyses and researches.

  • PDF

An Optimal Intermodal-Transport Algorithm using Dynamic Programming (동적 프로그래밍을 이용한 최적복합운송 알고리즘)

  • Cho Jae-Hyung;Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Kang Moo-Hong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.20-33
    • /
    • 2006
  • Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

  • PDF

Design Optimization for 3D Woven Materials Based on Regression Analysis (회귀 분석에 기반한 3차원 엮임 재료의 최적설계)

  • Byungmo, Kim;Kichan, Sim;Seung-Hyun, Ha
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.6
    • /
    • pp.351-356
    • /
    • 2022
  • In this paper, we present the regression analysis and design optimization for improving the permeability of 3D woven materials based on numerical analysis data. First, the parametric analysis model is generated with variables that define the gap sizes between each directional wire of the woven material. Then, material properties such as bulk modulus, thermal conductivity coefficient, and permeability are calculated using numerical analysis, and these material data are used in the polynomial-based regression analysis. The Pareto optimal solution is obtained between bulk modulus and permeability by using multi-objective optimization and shows their trade-off relation. In addition, gradient-based design optimization is applied to maximize the fluid permeability for 3D woven materials, and the optimal designs are obtained according to the various minimum bulk modulus constraints. Finally, the optimal solutions from regression equations are verified to demonstrate the accuracy of the proposed method.

Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs

  • Hirakawa, Yasuhiro;Ishigaki, Aya
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.2
    • /
    • pp.134-139
    • /
    • 2011
  • The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.