• Title/Summary/Keyword: many-objective optimization algorithms

Search Result 42, Processing Time 0.028 seconds

Goal-Pareto based NSGA Optimization Algorithm (Goal-Pareto 기반의 NSGA 최적화 알고리즘)

  • Park, Jun-Su;Park, Soon-Kyu;Shin, Yo-An;Yoo, Myung-Sik;Lee, Won-Cheol
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.108-115
    • /
    • 2007
  • This paper proposes a new optimization algorithm prescribed by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) whose result satisfies the user's needs and goals to enhance the performance of optimization. Typically, lots of real-world engineering problems encounter simultaneous optimization subject to satisfying prescribed multiple objectives. Unfortunately, since these objectives might be mutually competitive, it is hardly to find a unique solution satisfying every objectives. Instead, many researches have been investigated in order to obtain an optimal solution with sacrificing more than one objectives. This paper introduces a novel optimization scheme named by GBNSGA obeying both goals as well as objectives as possible as it can via allocating candidated solutions on Pareto front, which enhances the performance of Pareto based optimization. The performance of the proposed GBNSGA will be compared with that of the conventional NSGA and weighted-sum approach.

Structural Damage Assessment Based on Model Updating and Neural Network (신경망 및 모델업데이팅에 기초한 구조물 손상평가)

  • Cho, Hyo-Nam;Choi, Young-Min;Lee, Sung-Chil;Lee, Kwang-Min
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.7 no.4
    • /
    • pp.121-128
    • /
    • 2003
  • In recent years, various artificial neural network algorithms are used in the damage assessment of civil infrastructures. So far, many researchers have used the artificial neural network as a pattern classifier for the structural damage assessment but, in this paper, the neural network is used as a structural reanalysis tool not as a pattern classifier. For the model updating using the optimization algorithm, the summation of the absolute differences in the structural vibration modes between undamaged structures and damaged ones is considered as an objective function. The stiffness of structural components are treated as unknown parameters to be determined. The structural damage detection is achieved using model updating based on the optimization techniques which determine the estimated stiffness of components minimizing the objective function. For the verification of the proposed damage identification algorithm, it is numerically applied to a simply supported bridge model.

An Efficient Model Based on Smoothed ℓ0 Norm for Sparse Signal Reconstruction

  • Li, Yangyang;Sun, Guiling;Li, Zhouzhou;Geng, Tianyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2028-2041
    • /
    • 2019
  • Compressed sensing (CS) is a new theory. With regard to the sparse signal, an exact reconstruction can be obtained with sufficient CS measurements. Nevertheless, in practical applications, the transform coefficients of many signals usually have weak sparsity and suffer from a variety of noise disturbances. What's worse, most existing classical algorithms are not able to effectively solve this issue. So we proposed an efficient algorithm based on smoothed ${\ell}_0$ norm for sparse signal reconstruction. The direct ${\ell}_0$ norm problem is NP hard, but it is unrealistic to directly solve the ${\ell}_0$ norm problem for the reconstruction of the sparse signal. To select a suitable sequence of smoothed function and solve the ${\ell}_0$ norm optimization problem effectively, we come up with a generalized approximate function model as the objective function to calculate the original signal. The proposed model preserves sharper edges, which is better than any other existing norm based algorithm. As a result, following this model, extensive simulations show that the proposed algorithm is superior to the similar algorithms used for solving the same problem.

Optimal aerodynamic design of hypersonic inlets by using streamline-tracing techniques

  • Xiong, Bing;Ferlauto, Michele;Fan, Xiaoqiang
    • Advances in aircraft and spacecraft science
    • /
    • v.7 no.5
    • /
    • pp.441-458
    • /
    • 2020
  • Rectangular-to-Ellipse Shape Transition (REST) inlets are a class of inward turning inlets designed for hypersonic flight. The aerodynamic design of REST inlets involves very complex flows and shock-wave patterns. These inlets are used in highly integrated propulsive systems. Often the design of these inlets may require many geometrical constraints at different cross-section. In present work a design approach for hypersonic inward-turning inlets, adapted for REST inlets, is coupled with a multi-objective optimization procedure. The automated procedure iterates on the parametric representation and on the numerical solution of a base flow from which the REST inlet is generated by using streamline tracing and shape transition algorithms. The typical design problem of optimizing the total pressure recovery and mass flow capture of the inlet is solved by the proposed procedure. The accuracy of the optimal solutions found is discussed and the performances of the designed REST inlets are investigated by means of fully 3-D Euler and 3-D RANS analyses.

Construction of Insulator and Isolator Database by Using Response Surface Model based on Taguchi's Orthogonal Array (다구찌 직교배열의 반응표면모델에 의한 흡차음재 소재 DB 구축)

  • Lee, Kwang-Ki;Kim, Byung-Hoon;Jun, In-Ki;Kang, Kyung-Soon;Kim, Ok-Bin
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.06a
    • /
    • pp.619-624
    • /
    • 2000
  • Design of experiments based on Taguchi's orthogonal array is utilized for exploring the design space and for building response surface models of insulator and isolator database in order to facilitate the effective solution of multi-objective optimization commonly occurred in NVH problems. Response surface models, called engineering database of design space, provide an efficient means to rapidly model the trade-off among many conflicting NVH goals in automotive. In the design of insulator and isolator in automotive interior part, it is important not only to construct effective matrices of NVH but also to build up engineering database of current products. The experimental design especially based on orthogonal array and the nonlinear optimization algorithms are successfully used together to obtain the optimal design of insulator and isolator. The $2^{nd}$ order response surface models of absorption coefficient and insertion loss are constructed by using modified Taguchi's $L_{12}2^13^7$ orthogonal array and successfully used in optimal design of insulator and isolator.

  • PDF

Fuzzy Indexing and Retrieval in CBR with Weight Optimization Learning for Credit Evaluation

  • Park, Cheol-Soo;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.491-501
    • /
    • 2002
  • Case-based reasoning is emerging as a leading methodology for the application of artificial intelligence. CBR is a reasoning methodology that exploits similar experienced solutions, in the form of past cases, to solve new problems. Hybrid model achieves some convergence of the wide proliferation of credit evaluation modeling. As a result, Hybrid model showed that proposed methodology classify more accurately than any of techniques individually do. It is confirmed that proposed methodology predicts significantly better than individual techniques and the other combining methodologies. The objective of the proposed approach is to determines a set of weighting values that can best formalize the match between the input case and the previously stored cases and integrates fuzzy sit concepts into the case indexing and retrieval process. The GA is used to search for the best set of weighting values that are able to promote the association consistency among the cases. The fitness value in this study is defined as the number of old cases whose solutions match the input cases solution. In order to obtain the fitness value, many procedures have to be executed beforehand. Also this study tries to transform financial values into category ones using fuzzy logic approach fur performance of credit evaluation. Fuzzy set theory allows numerical features to be converted into fuzzy terms to simplify the matching process, and allows greater flexibility in the retrieval of candidate cases. Our proposed model is to apply an intelligent system for bankruptcy prediction.

  • PDF

An Empirical Study on Statistical Optimization Model for the Portfolio Construction of Sponsored Search Advertising(SSA) (키워드검색광고 포트폴리오 구성을 위한 통계적 최적화 모델에 대한 실증분석)

  • Yang, Hognkyu;Hong, Juneseok;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.2
    • /
    • pp.167-194
    • /
    • 2019
  • This research starts from the four basic concepts of incentive incompatibility, limited information, myopia and decision variable which are confronted when making decisions in keyword bidding. In order to make these concept concrete, four framework approaches are designed as follows; Strategic approach for the incentive incompatibility, Statistical approach for the limited information, Alternative optimization for myopia, and New model approach for decision variable. The purpose of this research is to propose the statistical optimization model in constructing the portfolio of Sponsored Search Advertising (SSA) in the Sponsor's perspective through empirical tests which can be used in portfolio decision making. Previous research up to date formulates the CTR estimation model using CPC, Rank, Impression, CVR, etc., individually or collectively as the independent variables. However, many of the variables are not controllable in keyword bidding. Only CPC and Rank can be used as decision variables in the bidding system. Classical SSA model is designed on the basic assumption that the CPC is the decision variable and CTR is the response variable. However, this classical model has so many huddles in the estimation of CTR. The main problem is the uncertainty between CPC and Rank. In keyword bid, CPC is continuously fluctuating even at the same Rank. This uncertainty usually raises questions about the credibility of CTR, along with the practical management problems. Sponsors make decisions in keyword bids under the limited information, and the strategic portfolio approach based on statistical models is necessary. In order to solve the problem in Classical SSA model, the New SSA model frame is designed on the basic assumption that Rank is the decision variable. Rank is proposed as the best decision variable in predicting the CTR in many papers. Further, most of the search engine platforms provide the options and algorithms to make it possible to bid with Rank. Sponsors can participate in the keyword bidding with Rank. Therefore, this paper tries to test the validity of this new SSA model and the applicability to construct the optimal portfolio in keyword bidding. Research process is as follows; In order to perform the optimization analysis in constructing the keyword portfolio under the New SSA model, this study proposes the criteria for categorizing the keywords, selects the representing keywords for each category, shows the non-linearity relationship, screens the scenarios for CTR and CPC estimation, selects the best fit model through Goodness-of-Fit (GOF) test, formulates the optimization models, confirms the Spillover effects, and suggests the modified optimization model reflecting Spillover and some strategic recommendations. Tests of Optimization models using these CTR/CPC estimation models are empirically performed with the objective functions of (1) maximizing CTR (CTR optimization model) and of (2) maximizing expected profit reflecting CVR (namely, CVR optimization model). Both of the CTR and CVR optimization test result show that the suggested SSA model confirms the significant improvements and this model is valid in constructing the keyword portfolio using the CTR/CPC estimation models suggested in this study. However, one critical problem is found in the CVR optimization model. Important keywords are excluded from the keyword portfolio due to the myopia of the immediate low profit at present. In order to solve this problem, Markov Chain analysis is carried out and the concept of Core Transit Keyword (CTK) and Expected Opportunity Profit (EOP) are introduced. The Revised CVR Optimization model is proposed and is tested and shows validity in constructing the portfolio. Strategic guidelines and insights are as follows; Brand keywords are usually dominant in almost every aspects of CTR, CVR, the expected profit, etc. Now, it is found that the Generic keywords are the CTK and have the spillover potentials which might increase consumers awareness and lead them to Brand keyword. That's why the Generic keyword should be focused in the keyword bidding. The contribution of the thesis is to propose the novel SSA model based on Rank as decision variable, to propose to manage the keyword portfolio by categories according to the characteristics of keywords, to propose the statistical modelling and managing based on the Rank in constructing the keyword portfolio, and to perform empirical tests and propose a new strategic guidelines to focus on the CTK and to propose the modified CVR optimization objective function reflecting the spillover effect in stead of the previous expected profit models.

Development of Improved Clustering Harmony Search and its Application to Various Optimization Problems (개선 클러스터링 화음탐색법 개발 및 다양한 최적화문제에 적용)

  • Choi, Jiho;Jung, Donghwi;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.630-637
    • /
    • 2018
  • Harmony search (HS) is a recently developed metaheuristic optimization algorithm. HS is inspired by the process of musical improvisation and repeatedly searches for the optimal solution using three operations: random selection, memory recall (or harmony memory consideration), and pitch adjustment. HS has been applied by many researchers in various fields. The increasing complexity of real-world optimization problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms and HS are required. We propose an improved clustering harmony search (ICHS) that uses a clustering technique to group solutions in harmony memory based on their objective function values. The proposed ICHS performs modified harmony memory consideration in which decision variables of solutions in a high-ranked cluster have higher probability of being selected than those in a low-ranked cluster. The ICHS is demonstrated in various optimization problems, including mathematical benchmark functions and water distribution system pipe design problems. The results show that the proposed ICHS outperforms other improved versions of HS.

Comparison between Cournot-Nash and Stackelberg Game in Bi-level Program (Bi-level program에서 Cournot-Nash게임과 Stackelberg게임의 비교연구)

  • Lim, Yong-Taek;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.99-106
    • /
    • 2004
  • This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.