• Title/Summary/Keyword: Pareto optimality

Search Result 31, Processing Time 0.025 seconds

Multi-Objective Optimization of Multistory Shear Building Under Seismic Loads (지진하중을 받는 다층 뼈대구조물의 다목적 최적설계)

  • 조효남;민대홍;정봉교
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.10a
    • /
    • pp.255-262
    • /
    • 2002
  • In this paper, an improved multi-objective optimmum design method is proposed. And it is applied to steel frames under seismic loads. The multi-objective optimization problem is formulated with three optimality criteria, namely, minimum structural weight and maximum strain energy and stability. The Pareto curve can be obtained by performing the multi-objective optimization for multistory shear buildings. In order to efficiently solve the multi-objective optimization problem the decomposition method that separates both system-level and element-level is used. In addition, various techniques such as effective reanalysis technique with respect to intermediate variables and sensitivity analysis using an automatic differentiation (AD) we incorporated. Moreover, the relationship function among section properties induced from the profile is used in order to link system-level and element level. From the results of numerical investigation, it may be stated that the proposed method will lead to the more rational design compared with the conventional one.

  • PDF

Study on multi-objective optimization method for radiation shield design of nuclear reactors

  • Yao Wu;Bin Liu;Xiaowei Su;Songqian Tang;Mingfei Yan;Liangming Pan
    • Nuclear Engineering and Technology
    • /
    • v.56 no.2
    • /
    • pp.520-525
    • /
    • 2024
  • The optimization design problem of nuclear reactor radiation shield is a typical multi-objective optimization problem with almost 10 sub-objectives and the sub-objectives are always demanded to be under tolerable limits. In this paper, a design method combining multi-objective optimization algorithms with paralleling discrete ordinate transportation code is developed and applied to shield design of the Savannah nuclear reactor. Three approaches are studied for light-weighted and compact design of radiation shield. Comparing with directly optimization with 10 objectives and the single-objective optimization, the approach by setting sub-objectives representing weight and volume as optimization objectives while treating other sub-objectives as constraints has the best performance, which is more suitable to reactor shield design.

Design of an Optimal Controller with Neural Networks for Nonminimum Phase Systems (신경 회로망을 이용한 비최소 위상 시스템의 최적 제어기 설계)

  • 박상봉;박철훈
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.6
    • /
    • pp.56-66
    • /
    • 1998
  • This paper investigates a neuro-controller combined in parallel with a conventional linear controller of PID type in order to control nonminimum phase systems more efficiently. The objective is to minimize overall position errors as well as to maintain small undershooting. A costfunction is proposed with two conflict objectives. The neuro-controller is trained off-line with evolutionary programming(EP) in such a way that it becomes optimal by minimizing the given cost function through global evaluation based on desired control performance during the whole training time interval. However, it is not easy to find an optimal solution which satisfies individual objective simultaneously. With the concept of Pareto optimality and EP, we train the proposed controller more effectively and obtain a valuable set of optimal solutions. Simulation results show the efficacy of the proposed controller in a viewpoint of improvement of performance of a step response like fast settling time and small undershoot or overshoot compared with that of a conventional linear controller.

  • PDF

On the Bayesian Fecision Making Model of 2-Person Coordination Game (2인 조정게임의 베이지안 의사결정모형)

  • 김정훈;정민용
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.113-143
    • /
    • 1997
  • Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

  • PDF

Bicriteria optimal design of open cross sections of cold-formed thin-walled beams

  • Ostwald, M.;Magnucki, K.;Rodak, M.
    • Steel and Composite Structures
    • /
    • v.7 no.1
    • /
    • pp.53-70
    • /
    • 2007
  • This paper presents a analysis of the problem of optimal design of the beams with two I-type cross section shapes. These types of beams are simply supported and subject to pure bending. The strength and stability conditions were formulated and analytically solved in the form of mathematical equations. Both global and selected types of local stability forms were taken into account. The optimization problem was defined as bicriteria. The cross section area of the beam is the first objective function, while the deflection of the beam is the second. The geometric parameters of cross section were selected as the design variables. The set of constraints includes global and local stability conditions, the strength condition, and technological and constructional requirements in the form of geometric relations. The optimization problem was formulated and solved with the help of the Pareto concept of optimality. During the numerical calculations a set of optimal compromise solutions was generated. The numerical procedures include discrete and continuous sets of the design variables. Results of numerical analysis are presented in the form of tables, cross section outlines and diagrams. Results are discussed at the end of the work. These results may be useful for designers in optimal designing of thin-walled beams, increasing information required in the decision-making procedure.

Using the Maximin Criterion in Process Capability Function Approach to Multiple Response Surface Optimization (다중반응표면최적화를 위한 공정능력함수법에서 최소치최대화 기준의 활용에 관한 연구)

  • Jeong, In-Jun
    • Knowledge Management Research
    • /
    • v.20 no.3
    • /
    • pp.39-47
    • /
    • 2019
  • Response surface methodology (RSM) is a group of statistical modeling and optimization methods to improve the quality of design systematically in the quality engineering field. Its final goal is to identify the optimal setting of input variables optimizing a response. RSM is a kind of knowledge management tool since it studies a manufacturing or service process and extracts an important knowledge about it. In a real problem of RSM, it is a quite frequent situation that considers multiple responses simultaneously. To date, many approaches are proposed for solving (i.e., optimizing) a multi-response problem: process capability function approach, desirability function approach, loss function approach, and so on. The process capability function approach first estimates the mean and standard deviation models of each response. Then, it derives an individual process capability function for each response. The overall process capability function is obtained by aggregating the individual process capability function. The optimal setting is given by maximizing the overall process capability function. The existing process capability function methods usually use the arithmetic mean or geometric mean as an aggregation operator. However, these operators do not guarantee the Pareto optimality of their solution. Moreover, they may bring out an unacceptable result in terms of individual process capability function values. In this paper, we propose a maximin-based process capability function method which uses a maximin criterion as an aggregation operator. The proposed method is illustrated through a well-known multiresponse problem.

A Cooperation Mechanism among Seller Agents based on Exchanging Goods in Agent-mediated Electronic Commerce

  • Ito, Takayuki;Hattori, Hiromitsy;Shintani, Toramatsu
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.89-96
    • /
    • 2001
  • Agent-mediated electronic markets have been a grow-ing area of agent research and developmen tin recent year. There exist a lot of e-commerce sites on the In-ternet(e.g. Priceline, com, Amazon, com etc). These e-commerce site have proposed new business models for effective and efficient commerce activity. Intelli-gent agents have been studied very widely in the field of artificial intelligence, For purpose of this paper, an agent can act autonomously and collaboratively in a network environment on behalf of its users. It is hard for people to effectively and efficiently monitor, buy, and sell at multiple e-commerce sites. If we intro-duce agent technologies into e-commerce systems, we can expect to further enhance the intelligence of their support. In this paper, we propose a new coopera-tion mechanism among seller agents based on exchang-ing their goods in our agent-mediated electronic market system. G-Commerce. On G-Commerce, seller agents and buyer agents negotiate with each other. In our model, seller agents cooperatively negotiate in order to effectively sell goods in stock. Buyer agents coopera-tively form coalitions in order to buy goods based an discount proices. Seller agent's negotiation goods. Our current experiments show that exchanging mechanism enables seller agents to effectively sell goods in stock. Also, we present the Pareto optimality of our exchang-ing mechanism.

  • PDF

Pigouvian Tax and the Congestion Externality -A Benefit Side Approach- (도로혼잡 외부효과와 피구세: 편익측면 분석)

  • Lee, Dug Man
    • Environmental and Resource Economics Review
    • /
    • v.12 no.1
    • /
    • pp.75-90
    • /
    • 2003
  • In this paper we have shown that a Pigouvian tax is an adequate resolution of congestion externality to attain Pareto optimality using utility maximization. For this objective, taking an open access freeway as an example, we not only derived both marginal private benefit and marginal social benefit, but also assessed the divergence between marginal private benefit and marginal social benefit. As a result, we identified that the amount of a Pigouvian tax should be the same amount as the external time cost, which is the value of the marginal time cost to Individual a incurred by Individual b through freeway congestion. This Pigouvian tax coincides with the profit or wealth maximizing toll suggested by literature on the basis of profit maximization. In addition, because an open access freeway is accounted as common property resource, we proved that average social congestion cost is essentially equal to marginal private congestion cost in our model. Finally, we showed that the optimal value of trip derived in our model is the same as that generated on profit maximization approach.

  • PDF

Cleaning Area Division Algorithm for Power Minimized Multi-Cleanup Robots Based on Nash Bargaining Solution (Nash 협상 해법 기반 전력 최소화를 위한 다중 청소로봇간 영역분배 알고리즘)

  • Choi, Jisoo;Park, Hyunggon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.400-406
    • /
    • 2014
  • In this paper, we propose an approach to minimizing total power consumption by deploying multiple clean-up robots simultaneously in a given area. For this, we propose to use the cooperative game theoretic approaches (i.e., Nash bargaining solution (NBS)) such that the robots can optimally and fairly negotiate the area division based on available resources and characteristics of the area, thereby leading to the minimum total power consumption. We define a utility function that includes power consumptions for characteristics of areas and the robots can agree on a utility pair based on the NBS. Simulation results show that the proposed approach can reduce the total average power consumption by 15-30% compared to a random area division approach.

A Genetic Algorithm with a New Encoding Method for Bicriteria Network Designs (2기준 네트워크 설계를 위한 새로운 인코딩 방법을 기반으로 하는 유전자 알고리즘)

  • Kim Jong-Ryul;Lee Jae-Uk;Gen Mituso
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.963-973
    • /
    • 2005
  • Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.