• Structural Engineering and Mechanics
• /
• v.45 no.3
• /
• pp.391-410
• /
• 2013

A numerical method is presented here to detect and assess structural damages from changes in natural frequencies using Ant Colony Optimization (ACO) algorithm. It is possible to formulate the inverse problem in terms of optimization and then to utilize a solution technique employing ACO to assess the damage/damages of structures using natural frequencies. The laboratory tested data has been used to verify the proposed algorithm. The study indicates the potentiality of the developed code to solve a wide range of inverse identification problems in a systematic manner. The developed code is used to assess damages of beam like structures using a first few natural frequencies. The outcomes of the simulated results show that the developed method can detect and estimate the amount of damages with satisfactory precision.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1230-1233
• /
• 1993

Numerical solution of inverse problem of Takagi-Sugeno fuzzy model is proposed. The method is located on the application of numerical optimization to the fuzzy model. Steepest descent method is used for the numerical optimization. We use the linear approximation of fuzzy model, called pseudo first order approximation, by fixing the membership value on the neighborhood of the corresponding input. It is introduced in order to reduce the difficulty of optimization process. The efficiency of this method is shown by a numerical experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.2-42
• /
• 2002

We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.315-318
• /
• 1995

The optimum design problem of a coat-hanger die is solved by the inverse formulation. The flow in the die is analyzed using three-dimensional model. The new model for the manifold geometry is developed for the inverse formulation. The inverse problem for the optimum die geometry is formed as the optimization problem whose objective function is the linear combination of the square sum of pressure gradient deviation at die exit and the penalty function relating to the measure of non-smoothness of solution. From the several iterative solutions of the optimization problem, the optimum solution can be obtained automatically while producing the uniform flow rate distribution at die exit.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.38 no.9
• /
• pp.747-755
• /
• 2014

The heat transfer mechanism for radiation is directly related to the emission of photons and electromagnetic waves. Depending on the participation of the medium, the radiation can be classified into two forms: surface and gas radiation. In the present study, unknown radiation properties were estimated using an inverse boundary analysis of surface radiation in an axisymmetric cylindrical enclosure. For efficiency, a repulsive particle swarm optimization (RPSO) algorithm, which is a relatively recent heuristic search method, was used as inverse solver. By comparing the convergence rates and accuracies with the results of a genetic algorithm (GA), the performances of the proposed RPSO algorithm as an inverse solver was verified when applied to the inverse analysis of the surface radiation problem.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2476-2481
• /
• 2007

An inverse radiation analysis is presented for the estimation of the wall emissivities for an absorbing, emitting, and scattering media with diffusely emitting and reflecting opaque boundaries. In this study, a repulsive particle swarm optimization(RPSO) algorithm which is a relatively recent heuristic search method is proposed as an effective method for improving the search efficiency for unknown parameters. To verify the performance of the proposed RPSO algorithm, it is compared with a basic particle swarm optimization(PSO) algorithm and a hybrid genetic algorithm(HGA) for the inverse radiation problem with estimating the wall emissivities in a two-dimensional irregular medium when the measured temperatures are given at only four data positions. A finite-volume method is applied to solve the radiative transfer equation of a direct problem to obtain measured temperatures.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1079-1101
• /
• 2020

This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.