• 제어로봇시스템학회논문지
• /
• 제9권2호
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.39-50
• /
• 2015

Genetic algorithm (GA) and particle swarm optimization (PSO) are two excellent approaches to multimodal optimization problems. However, slow convergence or premature convergence readily occurs because of inappropriate and inflexible evolution. In this paper, a novel optimization algorithm with a flexible grid optimization (FGO) is suggested to provide adaptive trade-off between exploration and exploitation according to the specific objective function. Meanwhile, a uniform agents array with adaptive scale is distributed on the gird to speed up the calculation. In addition, a dominance centroid and a fitness center are proposed to efficiently determine the potential guides when the population size varies dynamically. Two types of subregion division strategies are designed to enhance evolutionary diversity and convergence, respectively. By examining the performance on four benchmark functions, FGO is found to be competitive with or even superior to several other popular algorithms in terms of both effectiveness and efficiency, tending to reach the global optimum earlier. Moreover, FGO is evaluated by applying it to a parameter decision in a least squares support vector machine (LS-SVM) to verify its practical competence.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.18-21
• /
• 1995

In this paper we describe a new method for multimodal function optimization using genetic algorithms(GAs). We propose adaptation rules for GA parameters such as population size, crossover probability and mutation probability. In the self organizing genetic algorithm(SOGA), SOGA parameters change according to the adaptation rules. Thus, we do not have to set the parameters manually. We discuss about SOGA and those of other approaches for adapting operator probabilities in GAs. The validity of the proposed algorithm will be verified in a simulation example of system identification.

• 제어로봇시스템학회논문지
• /
• 제13권5호
• /
• pp.467-473
• /
• 2007

In this paper, we present a position-based robot hand tracking scheme where a pan-tilt camera is controlled such that a robot hand is always shown in the center of an image frame. We calculate the rotation angles of a pan-tilt camera by transforming the coordinate systems. In order to identify the model parameters, we applied two optimization techniques: a nonlinear least square optimizer and a particle swarm optimizer. From the simulation results, it is shown that the considered parameter identification problem is characterized by a highly multimodal landscape; thus, a global optimization technique such as a particle swarm optimization could be a promising tool to identify the model parameters of a robot hand tracking system, whereas the nonlinear least square optimizer often failed to find an optimal solution even when the initial candidate solutions were selected close to the true optimum.

• Structural Engineering and Mechanics
• /
• 제88권4호
• /
• pp.323-334
• /
• 2023

The submerged floating tunnel (SFT) infrastructure has been regarded as an emerging technology that efficiently and safely connects land and islands. The SFT route problem is an essential part of the SFT planning and design phase, with significant impacts on the surrounding environment. This study aims to develop an optimization model considering transportation and structure factors. The SFT routing problem was optimized based on two objective functions, i.e., minimizing total travel time and cumulative strains, using NSGA-II. The proposed model was applied to the section from Mokpo to Jeju Island using road network and wave observation data. As a result of the proposed model, a Pareto optimum curve was obtained, showing a negative correlation between the total travel time and cumulative strain. Based on the inflection points on the Pareto optimum curve, four optimal SFT routes were selected and compared to identify the pros and cons. The travel time savings of the four selected alternatives were estimated to range from 9.9% to 10.5% compared to the non-implemented scenario. In terms of demand, there was a substantial shift in the number of travel and freight trips from airways to railways and roadways. Cumulative strain, calculated based on SFT distance, support structure, and wave energy, was found to be low when the route passed through small islands. The proposed model helps decision-making in the planning and design phases of SFT projects, ultimately contributing to the progress of a safe, efficient, and sustainable SFT infrastructure.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2002년도 Proceedings
• /
• pp.450-453
• /
• 2002

In radiotherapy treatment planning, it is critical to deliver the radiation dose to tumor and protect surrounding normal tissue. Recent developments in functional imaging and radiotherapy treatment technology have been raising chances to control tumor saving normal tissues. A brain phantom which could be used for image registration technique of CT-MR and CT-SPECT images using surface matching was developed. The brain phantom was specially designed to obtain imaging dataset of CT, MR, and SPECT. The phantom had an external frame with 4 N-shaped pipes filled with acryl rods, Pb rods for CT, MR, and SPECT imaging, respectively. 8 acrylic pipes were inserted into the empty space of the brain phantom to be imaged for geometric evaluation of the matching. For an optimization algorithm of image registration, we used Downhill simplex algorithm suggested as a fast surface matching algorithm. Accuracy of image fusion was assessed by the comparison between the center points of the section of N-shaped bars in the external frame and the inserted pipes of the phantom and minimized cost functions of the optimization algorithm. Technique with partially transparent, mixed images using color on gray was used for visual assessment of the image registration process. The errors of image registration of CT-MR and CT-SPECT were within 2mm and 4mm, respectively. Since these errors were considered within a reasonable margin from the phantom study, the phantom is expected to be used for conventional image registration between multimodal image datasets..

• 한국항만경제학회:학술대회논문집
• /
• 한국항만경제학회 2007년도 국제학술대회 및 정기총회
• /
• pp.161-173
• /
• 2007

This paper considers the problem of determining the cargo flow and the transportation mode in each trade route while satisfying the demand. Especially, the problem incorporates short sea shipping in Korea, which is becoming more important in order to improve efficiency of Logistics. The objective is to minimize the sum of shipping and inland transportation costs. To solve optimally the problem, this paper employs a linear programming model, which is an operations research technique for optimization. The problem is formulated by extending the well-known network design problem by considering capacity at seaport and limitation of total number of vehicles. The model is solved using CPLEX, a commercial linear program software. The test results using a real cargo flow data in Korea show that the model represents closely the real situation.

• 대한기계학회논문집A
• /
• 제26권9호
• /
• pp.1806-1813
• /
• 2002

It is well known that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a classical optimization technique was adopted by previous researchers. That technique overcame the difficulty of finding the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However, it is hard to select a trial solution initially for optimization because the defined objective function is heavily multimodal. A method is presented in this paper, which uses continuous evolutionary algorithms(CEAs). CEAs are effective for solving inverse problems and implemented on PC clusters to shorten calculation time. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising with high parallel efficiency over about 94%.

• 정보과학회 논문지
• /
• 제41권12호
• /
• pp.1090-1098
• /
• 2014

이 연구는 단봉 전역 최적화 성능이 개선된 적응적 코시 분포 차분 진화 알고리즘을 제안한다. 기존 적응적 코시 분포 차분 진화 알고리즘은(ACDE) 개체의 다양성을 보장하여 다봉 전역 최적화 문제에 우수한 "DE/rand/1" 돌연변이 전략을 사용했다. 그러나 이 돌연변이 전략은 수렴 속도가 느려 단봉 전역 최적화 문제에 단점이 있다. 제안 알고리즘은 "DE/rand/1" 돌연변이 전략 대신 수렴 속도가 빠른 "DE/current-to-best/1" 돌연변이 전략을 사용했다. 이때, 개체의 다양성이 부족하여 발생할 수 있는 지역 최적해로의 수렴을 방지하기 위해서 매개변수 초기화 연산이 추가됐다. 매개변수 초기화 연산은 특정세대를 주기로 실행되거나 또는 선택 연산에서 모든 개체가 진화에 실패하는 경우 실행된다. 매개변수 초기화 연산은 각 개체들의 매개변수에 탐험적 특성이 높은 값을 할당하여 넓은 공간을 탐색할 수 있도록 보장한다. 성능 평가 결과, 개선된 적응적 코시 분포 차분 진화 알고리즘이 최신 차분 진화 알고리즘들에 비해 특히, 단봉 전역 최적화 문제에서 성능이 개선됨을 확인했다.

• Journal of Electrical Engineering and Technology
• /
• 제9권1호
• /
• pp.15-26
• /
• 2014

This paper proposes a Modified Particle Swarm Optimization with Time Varying Acceleration Coefficients (MPSO-TVAC) for solving economic load dispatch (ELD) problem. Due to prohibited operating zones (POZ) and ramp rate limits of the practical generators, the ELD problems become nonlinear and nonconvex optimization problem. Furthermore, the ELD problem may be more complicated if transmission losses are considered. Particle swarm optimization (PSO) is one of the famous heuristic methods for solving nonconvex problems. However, this method may suffer to trap at local minima especially for multimodal problem. To improve the solution quality and robustness of PSO algorithm, a new best neighbour particle called 'rbest' is proposed. The rbest provides extra information for each particle that is randomly selected from other best particles in order to diversify the movement of particle and avoid premature convergence. The effectiveness of MPSO-TVAC algorithm is tested on different power systems with POZ, ramp-rate limits and transmission loss constraints. To validate the performances of the proposed algorithm, comparative studies have been carried out in terms of convergence characteristic, solution quality, computation time and robustness. Simulation results found that the proposed MPSO-TVAC algorithm has good solution quality and more robust than other methods reported in previous work.