• Title/Summary/Keyword: Pareto-optimal Solution

Search Result 96, Processing Time 0.019 seconds

Development of Pareto-Optimal Technique for Generation Planning According to Environmental Characteristics in term (환경특성을 반영한 급전계획의 파레토 최적화기법 개발)

  • Lee, Buhm;Kim, Yong-ha;Choi, Sang-kyu
    • Journal of Energy Engineering
    • /
    • v.13 no.2
    • /
    • pp.128-132
    • /
    • 2004
  • This paper presents a new methodology to get pareto-optimal solution for generation planning. First, we apply dynamic programming, and we can get an optimal economic dispatch considering total quantity of contamination for the specified term. Second, we developed a method which can get pareto-optimal solution. This solution is consisted of a set of optimal generation planning. As a result, decision maker can get pareto-optimal solutions, and can choose a solution. We applied this method to the test system, and showed the usefulness.

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

  • Song, Jin-Dae;Yang, Bo-Suk
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.11 s.254
    • /
    • 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.

Internet Shopping Optimization Problem With Delivery Constraints

  • Chung, Ji-Bok
    • Journal of Distribution Science
    • /
    • v.15 no.2
    • /
    • pp.15-20
    • /
    • 2017
  • Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

Development of a Multiobjective Optimization Algorithm Using Data Distribution Characteristics (데이터 분포특성을 이용한 다목적함수 최적화 알고리즘 개발)

  • Hwang, In-Jin;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.12
    • /
    • pp.1793-1803
    • /
    • 2010
  • The weighting method and goal programming require weighting factors or target values to obtain a Pareto optimal solution. However, it is difficult to define these parameters, and a Pareto solution is not guaranteed when the choice of the parameters is incorrect. Recently, the Mahalanobis Taguchi System (MTS) has been introduced to minimize the Mahalanobis distance (MD). However, the MTS method cannot obtain a Pareto optimal solution. We propose a function called the skewed Mahalanobis distance (SMD) to obtain a Pareto optimal solution while retaining the advantages of the MD. The SMD is a new distance scale that multiplies the skewed value of a design point by the MD. The weighting factors are automatically reflected when the SMD is calculated. The SMD always gives a unique Pareto optimal solution. To verify the efficiency of the SMD, we present two numerical examples and show that the SMD can obtain a unique Pareto optimal solution without any additional information.

Development of Pareto-Optimal Technique for Generation Planning According to Environmental Characteristics in Term (환경특성을 고려한 다목적함수의 기간 발전계획 Pareto 최적화)

  • Lee, Buhm;Kim, Y.H.;Choi, S.K.;Cho, S.L.;Na, I.G.;Hwang, B.S.;Kim, Dong-Geun
    • Proceedings of the KIEE Conference
    • /
    • 2003.11a
    • /
    • pp.233-235
    • /
    • 2003
  • This paper describes a new methodology to get pareto-optimal generation planning for decision-making. To get optimal generation planning consider total quantity of contamination for the specified term, authors employ dynamic programming. And, in the course of dynamic programming, pareto optimal solution can be obtained. So, a most proper solution can be selected by derision-maker. The usefulness is verified by applying It to the test system.

  • PDF

Pareto optimum design of journal bearings by artificial life algorithm (인공생명최적화알고리듬에 의한 저널베어링의 파레토 최적화)

  • Song, Jin-Dae;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.869-874
    • /
    • 2005
  • This paper proposes the Pareto artificial life algorithm for a multi-objective function optimization problem. The artificial life algorithm for a single objective function optimization problem is improved through incorporating the new method to estimate the fitness value fur a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm is 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 are reported to present the possible solutions to a decision maker or a designer.

  • PDF

Pareto Optimal Design of the Vehicle Body (차체의 팔렛토 최적 설계)

  • Kim, Byoung-Gon;Chung, Tae-Jin;Lee, Jeong-Ick
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.17 no.4
    • /
    • pp.67-74
    • /
    • 2008
  • The important dynamic specifications in the aluminum automobile body design are the vibrations and crashworthiness in the views of ride comforts and safety. Thus, considerable effort has been invested into improving the performance of mechanical structures comprised of the interactive multiple sub-structures. Most mechanical structures are complex and are essentially multi-criteria optimization problems with objective functions retained as constraints. Each weight factor can be defined according to the effects and priorities among objective functions, and a feasible Pareto-optimal solution exists for the criteria-defined constraints. In this paper, a multi-criteria design based on the Pareto-optimal sensitivity is applied to the vibration qualities and crushing characteristics of front structure in the automobile body design. The vibration qualities include the idle, wheel unbalance and road shake. The crushing characteristic of front structure is the axial maximum peak load.

Multi-criteria Structural Optimization Methods and their Applications (다목적함수 최적구조설계 기법 및 응용)

  • Kim, Ki-Sung;Jin, Jin
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.4
    • /
    • pp.409-416
    • /
    • 2009
  • The structural design problems are acknowledged to be commonly multi-criteria in nature. The various multi-criteria optimization methods are reviewed and the most efficient and easy-to-use Pareto optimal solution methods are applied to structural optimization of a truss and a beam. The result of the study shows that Pareto optimal solution methods can easily be applied to structural optimization with multiple objectives, and the designer can have a choice from those Pareto optimal solutions to meet an appropriate design environment.

Multi-Objective Optimal Design of a Single Phase AC Solenoid Actuator Used for Maximum Holding Force and Minimum Eddy Current Loss

  • Yoon, Hee-Sung;Eum, Young-Hwan;Zhang, Yanli;Koh, Chang-Seop
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.218-223
    • /
    • 2008
  • A new Pareto-optimal design algorithm, requiring least computational work, is proposed for a single phase AC solenoid actuator with multi-design-objectives: maximizing holding force and minimizing eddy current loss simultaneously. In the algorithm, the design space is successively reduced by a suitable factor, as iteration repeats, with the center of pseudo-optimal point. At each iteration, the objective functions are approximated to a simple second-order response surface with the CCD sampling points generated within the reduced design space, and Pareto-optimal solutions are obtained by applying($1+{\lambda}$) evolution strategy with the fitness values of Pareto strength.

Fuzzy Group Decision Making for Multiple Decision Maker-Multiple Objective Programming Problems

  • Yano, Hitoshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.380-383
    • /
    • 2003
  • In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

  • PDF