• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.699-704
• /
• 2000

The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.911-917
• /
• 2017

There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4025-4041
• /
• 2020

Mobile edge computing (MEC) is capable of providing services to smart devices nearby through radio access networks and thus improving service experience of users. In this paper, an offloading strategy for the joint optimization of computing and communication resources in multi-user and multi-MEC overlapping scene was proposed. In addition, under the condition that wireless transmission resources and MEC computing resources were limited and task completion delay was within the maximum tolerance time, the optimization problem of minimizing energy consumption of all users was created, which was then further divided into two subproblems, i.e. offloading strategy and resource allocation. These two subproblems were then solved by the game theory and Lagrangian function to obtain the optimal task offloading strategy and resource allocation plan, and the Nash equilibrium of user offloading strategy games and convex optimization of resource allocation were proved. The simulation results showed that the proposed algorithm could effectively reduce the energy consumption of users.

• Journal of IKEEE
• /
• v.22 no.2
• /
• pp.455-459
• /
• 2018

In this paper, proposed a multi-channel charging control strategy for electric vehicle. This control strategy can adjust the charging power according to the calculated state-of-charge (SOC). Electric vehicle (EV) charging system using Particle Swarm Optimization (PSO) algorithm is proposed. A stochastic optimization algorithm technique such as PSO in the time-of-use (TOU) price used for the energy cost minimization. Simulation results show that the energy cost can be reduced using proposed method.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.9-16
• /
• 2004

This study presents results of aerodynamic wing optimization under uncertainties. To consider uncertainties, an alternative strategy for reliability-based design optimization(RBDO) is developed. The strategy utilizes a single loop algorithm and a sequential approximation optimization(SAO) technique. The SAO strategy relies on the trust region-SQP framework which validates approximated functions at every iteration. Further improvement in computational efficiency is achieved by applying the same sensitivity of limit state functions in the reliability analysis and in the equivalent deterministic constraint calculation. The framework is examined by solving an analytical test problem to show that the proposed framework has the computational efficiency over existing methods. The proposed strategy enables exploiting the RBDO technique in aerodynamic design. For the aerodynamic wing design problem, the solution converges to the reliable point satisfying the probabilistic constraints.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.515-520
• /
• 2009

According to the operating characteristics of pump applications, they should exhibit high efficiency and energy saving capabilities throughout the whole operating process. A novel efficiency optimization control strategy is presented here to meet the high efficiency demand of a variable speed Permanent Magnet Synchronous Motor (PMSM). The core of this strategy is the excellent integration of mended maximum torque to the current control algorithm, based on the losses model during the dynamic and the grade search method with changed step by fuzzy logic during the steady. The performance experiments for the control system of a variable speed high efficiency PMSM have been completed. The test results verified that the system can reliably operate with a different control strategy during dynamic and steady operation, and the system exhibits better performance when using the efficiency-optimization control.

• KSBB Journal
• /
• v.14 no.4
• /
• pp.495-502
• /
• 1999

The optimization of fed-batch yeast fermentation process has been performed using genetic algorithm(GA). Three strategies were designed and applied to obtain the optimal feed rate profiles. Genes in the chromosome (input variables for optimization) included feed rates on fixed time intervals (strategy I), or swiching times $t_s1\;and\;t_s2$, and feed rates on singular arc (strategy II), or feed rates and the length of time interval (strategy III). Strategy III showed the best results for all initial conditions due to efficient utilization of genetic information. Simulation results using GA showed similar or better performance compared with previous results by variational caculus and singular control approach.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.455-467
• /
• 2020

Shape design optimization for Blended-wing-body Underwater Gliders (BWBUGs) is usually computationally expensive. In our previous work, a simplified shape optimization (SSO) strategy is proposed to alleviate the computational burden, which optimizes some of the Sectional Airfoils (SAs) instead of optimizing the 3-D shape of the BWBUG directly. Test results show that SSO can obtain a good result at a much smaller computational cost when three SAs are adopted. In this paper, the performance of SSO is investigated with a different number of SAs selected from the BWBUG, and the results are compared with that of the Direct Shape Optimization (DSO) strategy. Results indicate that SSO tends to perform better with more SAs or even outperforms the DSO strategy in some cases, and the amount of saved computational cost also increases when more SAs are adopted, which provides some reference significance and enlarges the applicability range of SSO.