• 인터넷정보학회논문지
• /
• 제21권3호
• /
• pp.21-28
• /
• 2020

Fireworks Algorithm (FWA) is a relatively novel swarm-based metaheuristic algorithm for global optimization. To solve the low-efficient local searching problem and convergence of the FWA, this paper presents a Variable Amplitude Coefficient Fireworks Algorithm with Uniform Local Search Operator (namely VACUFWA). Firstly, the explosive amplitude is used to adjust improving the convergence speed dynamically. Secondly, Uniform Local Search (ULS) enhances exploitation capability of the FWA. Finally, the ULS and Variable Amplitude Coefficient operator are used in the VACUFWA. The comprehensive experiment carried out on 13 benchmark functions. Its results indicate that the performance of VACUFWA is significantly improved compared with the FWA, Differential Evolution, and Particle Swarm Optimization.

• 전기학회논문지
• /
• 제58권4호
• /
• pp.840-848
• /
• 2009

This paper proposes a new multi-start scheme that generates guided random bits in selecting initial search points for global optimization with univariate dynamic encoding algorithm for searches (uDEAS). The proposed method counts the number of 1 in each bit position from all the previously generated initial search matrices and, based on this information, generates 0 in proportion with the probability of selecting 1. This rule is simple and effective for improving diversity of initial search points. The performance improvement of the proposed multi-start is validated through implementation in uDEAS and function optimization experiments.

• Steel and Composite Structures
• /
• 제19권4호
• /
• pp.995-1009
• /
• 2015

This study presents design optimization of spot welded structures to attain maximum strength by using the Nelder-Mead (Simplex) method. It is the main idea of the algorithm that the simulation run is executed several times to satisfy predefined convergence criteria and every run uses the starting points of the previous configurations. The material and size of the sheet plates are the pre-assigned parameters which do not change in the optimization cycle. Locations of the spot welds, on the other hand, are chosen to be design variables. In order to calculate the objective function, which is the maximum equivalent stress, ANSYS, general purpose finite element analysis software, is used. To obtain global optimum locations of spot welds a methodology is proposed by modifying the Nelder-Mead (Simplex) method. The procedure is applied to a number of representative problems to demonstrate the validity and effectiveness of the proposed method. It is shown that it is possible to obtain the global optimum values without stacking local minimum ones by using proposed methodology.

• Genomics & Informatics
• /
• 제1권1호
• /
• pp.20-24
• /
• 2003

The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.961-972
• /
• 2008

In this paper, we consider the global exponential stability of cellular neural networks with time-varying delays. Based on the Lyapunov function method and convex optimization approach, a novel delay-dependent criterion of the system is derived in terms of LMI (linear matrix inequality). In order to solve effectively the LMI convex optimization problem, the interior point algorithm is utilized in this work. Two numerical examples are given to show the effectiveness of our results.

• 대한기계학회논문집A
• /
• 제30권6호
• /
• pp.691-697
• /
• 2006

Metamodel, model of model, has been widely used to improve an efficiency of optimization process in engineering fields. However, global metamodels of constraints in a constrained optimization problem are required good accuracy around neighborhood of optimum point. To satisfy this requirement, more sampling points must be located around the boundary and inside of feasible region. Therefore, a new sampling strategy that is capable of identifying feasible domain should be applied to select sampling points for metamodels of constraints. In this research, we suggeste sequential feasible domain sampling that can locate sampling points likely within feasible domain by using penalty function method. To validate the excellence of feasible domain sampling, we compare the optimum results from the proposed method with those form conventional global space-filling sampling for a variety of optimization problems. The advantages of the feasible domain sampling are discussed further.

• Journal of Mechanical Science and Technology
• /
• 제17권12호
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

• 전자공학회논문지B
• /
• 제30B권8호
• /
• pp.54-63
• /
• 1993

This paper proposes a method for improving the performances of the neural network for optimization by an optimal estimation of initial states. The optimal initial state that leads to the global minimum is estimated by using the stochastic approximation. And then the update rule of Hopfield model, which is the high speed deterministic algorithm using the steepest descent rule, is applied to speed up the optimization. The proposed method has been applied to the tavelling salesman problems and an optimal task partition problems to evaluate the performances. The simulation results show that the convergence speed of the proposed method is higher than conventinal Hopfield model. Abe's method and Boltzmann machine with random initial neuron output setting, and the convergence rate to the global minimum is guaranteed with probability of 1. The proposed method gives better result as the problem size increases where it is more difficult for the randomized initial setting to give a good convergence.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.725-730
• /
• 2000

Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

• 대한기계학회논문집A
• /
• 제24권7호
• /
• pp.1753-1762
• /
• 2000

An inverse method is presented to obtain material's flow properties by using small punch test. This procedure employs, as the objective function of inverse analysis, the balance of measured load-di splacement response and calculated one during deformation. In order to guarantee convergence to global minimum, simulated annealing method was adopted to optimize the current objective function. In addition, artificial neural network was used to predict the load-displacement response under given material parameters which is the most time consuming and limits applications of global optimization methods to these kinds of problems. By implementing the simulated annealing for optimization along with calculating load-displacement curve by neural network, material parameters were identified irrespective of initial values within very short time for simulated test data. We also tested the present method for error-containing experimental data and showed that the flow properties of material were well predicted.