• 제목/요약/키워드: Multi-objective Optimization Problem

검색결과 306건 처리시간 0.024초

피로수명예측을 위한 반응표면근사화와 절충의사결정문제의 응용 (Response Surface Approximation for Fatigue Life Prediction and Its Application to Compromise Decision Support Problem)

  • 백석흠;조석수;장득열;주원식
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회A
    • /
    • pp.1187-1192
    • /
    • 2008
  • In this paper, a versatile multi-objective optimization concept for fatigue life prediction is introduced. Multi-objective decision making in engineering design refers to obtaining a preferred optimal solution in the context of conflicting design objectives. Compromise decision support problems are used to model engineering decisions involving multiple trade-offs. These methods typically rely on a summation of weighted attributes to accomplish trade-offs among competing objectives. This paper gives an interpretation of the decision parameters as governing both the relative importance of the attributes and the degree of compensation between them. The approach utilizes a response surface model, the compromise decision support problem, which is a multi-objective formulation based on goal programming. Examples illustrate the concepts and demonstrate their applicability.

  • PDF

Application of multi objective genetic algorithm in ship hull optimization

  • Guha, Amitava;Falzaranoa, Jeffrey
    • Ocean Systems Engineering
    • /
    • 제5권2호
    • /
    • pp.91-107
    • /
    • 2015
  • Ship hull optimization is categorized as a bound, multi variable, multi objective problem with nonlinear constraints. In such analysis, where the objective function representing the performance of the ship generally requires computationally involved hydrodynamic interaction evaluation methods, the objective functions are not smooth. Hence, the evolutionary techniques to attain the optimum hull forms is considered as the most practical strategy. In this study, a parametric ship hull form represented by B-Spline curves is optimized for multiple performance criteria using Genetic Algorithm. The methodology applied to automate the hull form generation, selection of optimization solvers and hydrodynamic parameter calculation for objective function and constraint definition are discussed here.

Knee-driven many-objective sine-cosine algorithm

  • Hongxia, Zhao;Yongjie, Wang;Maolin, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권2호
    • /
    • pp.335-352
    • /
    • 2023
  • When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

혼합모델 조립라인의 다목적 투입순서 문제를 위한 유전알고리즘 (A Genetic Algorithm for a Multiple Objective Sequencing Problem in Mixed Model Assembly Lines)

  • 현철주;김여근
    • 대한산업공학회지
    • /
    • 제22권4호
    • /
    • pp.533-549
    • /
    • 1996
  • This paper is concerned with a sequencing problem in mixed model assembly lines, which is important to efficient utilization of the lines. In the problem, we deal with the two objectives of minimizing the risk of stoppage and leveling part usage, and consider sequence-dependent setup time. In this paper, we present a genetic algorithm(GA) suitable for the multi-objective optimization problem. The aim of multi-objective optimization problems is to find all possible non-dominated solutions. The proposed algorithm is compared with existing multi-objective GAs such as vector evaluated GA, Pareto GA, and niched Pareto GA. The results show that our algorithm outperforms the compared algorithms in finding good solutions and diverse non-dominated solutions.

  • PDF

근사 모델과 NSGA-II를 이용한 진공청소기 손잡이 근사최적설계 (Optimization of Vacuum Cleaner Handle Using Approximate Model and NSGA-II)

  • 윤민노;이종수
    • 한국생산제조학회지
    • /
    • 제26권1호
    • /
    • pp.30-35
    • /
    • 2017
  • The major parts of a vacuum cleaner are molded. The vacuum cleaner works in multi-load conditions. Therefore, the designer needs to optimize the structure and injection molding conditions simultaneously. Here, the main factor of design is the rib shape and thickness. The greater the rib thickness, the greater the stiffness of the structure. However, it causes an increase in weight. On the other hand, the lower the rib thickness, the greater the increase in the injection pressure. However, the weight will be reduced. Therefore, the designer needs to optimize the rib shape and thickness for structure stiffness and injection molding. In order to solve this problem, we propose an optimization method using D.O.E and a response surface model, which is a multi-objective optimization method using the multi-objective genetic algorithm.

DEVELOPMENT OF A TABU SEARCH HEURISTIC FOR SOLVING MULTI-OBJECTIVE COMBINATORIAL PROBLEMS WITH APPLICATIONS TO CONSTRUCTING DISCRETE OPTIMAL DESIGNS

  • JOO SUNG JUNG;BONG JIN YUM
    • Management Science and Financial Engineering
    • /
    • 제3권1호
    • /
    • pp.75-88
    • /
    • 1997
  • Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

  • PDF

Energy-Efficient Resource Allocation in Multi-User AF Two-Way Relay Channels

  • Kim, Seongjin;Yu, Heejung
    • Journal of Communications and Networks
    • /
    • 제18권4호
    • /
    • pp.629-638
    • /
    • 2016
  • In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.

Resource Allocation for Relay-Aided Cooperative Systems Based on Multi-Objective Optimization

  • Wu, Runze;Zhu, Jiajia;Hu, Hailin;He, Yanhua;Tang, Liangrui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권5호
    • /
    • pp.2177-2193
    • /
    • 2018
  • This paper studies resource allocation schemes for the relay-aided cooperative system consisting of multiple source-destination pairs and decode-forward (DF) relays. Specially, relaying selection, multisubcarrier pairing and assignment, and power allocation are investigated jointly. We consider a combinatorial optimization problem on quality of experience (QoE) and energy consumption based on relay-aided cooperative system. For providing better QoE and lower energy consumption we formulate a multi-objective optimization problem to maximize the total mean opinion score (MOS) value and minimize the total power consumption. To this end, we employ the nondominated sorting genetic algorithm version II (NSGA-II) and obtain sets of Pareto optimal solutions. Specially, two formulas are devised for the optimal solutions of the multi-objective optimization problems with and without a service priority constraint. Moreover, simulation results show that the proposed schemes are superior to the existing ones.

파레토 인공생명 최적화 알고리듬의 제안 (Development of Pareto Artificial Life Optimization Algorithm)

  • 송진대;양보석
    • 대한기계학회논문집A
    • /
    • 제30권11호
    • /
    • pp.1358-1368
    • /
    • 2006
  • This paper proposes a Pareto artificial life algorithm for solving multi-objective optimization problems. The artificial life algorithm for optimization problem with a single objective function is improved to handle Pareto optimization problem through incorporating the new method to estimate the fitness value for a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm was applied to the optimum design of a journal bearing which has two objective functions. The Pareto front and the optimal solution set for the application were presented to give the possible solutions to a decision maker or a designer. Furthermore, the relation between linearly combined single-objective optimization problem and Pareto optimization problem has been studied.

Symbiotic organisms search algorithm based solution to optimize both real power loss and voltage stability limit of an electrical energy system

  • Pagidi, Balachennaiah;Munagala, Suryakalavathi;Palukuru, Nagendra
    • Advances in Energy Research
    • /
    • 제4권4호
    • /
    • pp.255-274
    • /
    • 2016
  • This paper presents a novel symbiotic organisms search (SOS) algorithm to optimize both real power loss (RPL) and voltage stability limit (VSL) of a transmission network by controlling the variables such as unified power flow controller (UPFC) location, UPFC series injected voltage magnitude and phase angle and transformer taps simultaneously. Mathematically, this issue can be formulated as nonlinear equality and inequality constrained multi objective, multi variable optimization problem with a fitness function integrating both RPL and VSL. The symbiotic organisms search (SOS) algorithm is a nature inspired optimization method based on the biological interactions between the organisms in ecosystem. The advantage of SOS algorithm is that it requires a few control parameters compared to other meta-heuristic algorithms. The proposed SOS algorithm is applied for solving optimum control variables for both single objective and multi-objective optimization problems and tested on New England 39 bus test system. In the single objective optimization problem only RPL minimization is considered. The simulation results of the proposed algorithm have been compared with the results of the algorithms like interior point successive linear programming (IPSLP) and bacteria foraging algorithm (BFA) reported in the literature. The comparison results confirm the efficacy and superiority of the proposed method in optimizing both single and multi objective problems.