• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.04a
• /
• pp.187-194
• /
• 1995

Traditional genetic algorithms(GA) have mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its targe computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of read code GA are developed to use continuous design variables directly. The results of real code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As results of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the rent code GA developed here can be used for the general optimization problem.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.403-410
• /
• 1998

An immune system has powerful abilities such as memory recognition and learning how to respond to invading antigens, and has been applied to many engineering algorithms in recent year. In this paper, the combined optimization algorithm (Immune-Genetic Algorithm: IGA) is proposed for multi-optimization problems by introduction the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The new combined algorithm is applied to minimize the total weight of the rotor shaft and the transmitted forces at the bearings in order to demonstrate the merit of the combined algorithm. The inner diameter of the shaft and the bearing stiffness are chosen as the design variables. the results show that the combined algorithm can reduce both the weight of the shaft and the transmitted forces at the bearing with dynamic constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3565-3583
• /
• 2022

The task scheduling problem has received a lot of attention in recent years as a crucial area for research in the cloud environment. However, due to the difference in objectives considered by service providers and users, it has become a major challenge to resolve the conflicting interests of service providers and users while both can still take into account their respective objectives. Therefore, the task scheduling problem as a bi-objective game problem is formulated first, and then a task scheduling model based on the bi-objective game (TSBOG) is constructed. In this model, energy consumption and resource utilization, which are of concern to the service provider, and cost and task completion rate, which are of concern to the user, are calculated simultaneously. Furthermore, a many-objective evolutionary algorithm based on a partitioned collaborative selection strategy (MaOEA-PCS) has been developed to solve the TSBOG. The MaOEA-PCS can find a balance between population convergence and diversity by partitioning the objective space and selecting the best converging individuals from each region into the next generation. To balance the players' multiple objectives, a crossover and mutation operator based on dynamic games is proposed and applied to MaPEA-PCS as a player's strategy update mechanism. Finally, through a series of experiments, not only the effectiveness of the model compared to a normal many-objective model is demonstrated, but also the performance of MaOEA-PCS and the validity of DGame.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.10 no.1
• /
• pp.73-80
• /
• 2010

The optimal design of water distribution system have started with the least cost design of single objective function using fixed hydraulic variables, eg. fixed water demand and pipe roughness. However, more adequate design is accomplished with considering uncertainties laid on water distribution system such as uncertain future water demands, resulting in successful estimation of real network's behaviors. So, many researchers have suggested a variety of approaches to consider uncertainties in water distribution system using uncertainties quantification methods and the optimal design of multi-objective function is also studied. This paper suggests the new approach of a multi-objective optimization seeking the minimum cost and maximum robustness of the network based on two uncertain variables, nodal demands and pipe roughness uncertainties. Total design procedure consists of two folds: least cost design and final optimal design under uncertainties. The uncertainties of demands and roughness are considered with Latin Hypercube sampling technique with beta probability density functions and multi-objective genetic algorithms (MOGA) is used for the optimization process. The suggested approach is tested in a case study of real network named the New York Tunnels and the applicability of new approach is checked. As the computation time passes, we can check that initial populations, one solution of solutions of multi-objective genetic algorithm, spread to lower right section on the solution space and yield Pareto Optimum solutions building Pareto Front.

• Journal of Korea Water Resources Association
• /
• v.38 no.9 s.158
• /
• pp.737-746
• /
• 2005

Optimization is a process that searches an optimal solution to obtain maximum or minimum value of an objective function. Many researchers have focused on effective search algorithms for the optimum but few researches were interested in establishing the objective function. This study compares two approaches for the objective function: one allows a tradeoff among the objectives and the other does not allow a tradeoff by assigning weights for the absolute priority between the objectives. An optimization model using sampling stochastic dynamic programming was applied to these two objective functions and the resulting optimal policies were compared. As a result, the objective function with no tradeoff provides a decision making process that matches practical reservoir operations than that with a tradeoff allowed. Therefore, it is more reasonable to establish the objective function with no a tradeoff among the objectives for multi-purpose dam operation plan in Korea.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.6
• /
• pp.49-55
• /
• 2004

The increase of computing power makes stochastic optimization algorithms available in structural design. One of the stochastic algorithms, simulated annealing algorithm, has been applied to various structural optimization problems. By applying several cooling schedules such as simulated annealing (SA), Boltzmann annealing (BA), fast annealing (FA) and adaptive simulated annealing (ASA), truss structures are optimized to improve the quality of objective functions and reduce the number of function evaluations. In this paper, many cooling parameters have been applied to the cooling schedule of ASA. The influence of cooling parameters is investigated to find the rules of thumb for using ASA. Tn addition, the cooling schedule combined with BA and ASA is applied to the optimization of ten bar-truss and twenty five bar-truss structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3512-3528
• /
• 2016

A network with high mobility nodes or vehicles is vehicular ad hoc Network (VANET). For improvement in communication efficiency of VANET, many techniques have been proposed; one of these techniques is vehicular node clustering. Cluster nodes (CNs) and Cluster Heads (CHs) are elected or selected in the process of clustering. The longer the lifetime of clusters and the lesser the number of CHs attributes to efficient networking in VANETs. In this paper, a novel Clustering algorithm is proposed based on Ant Colony Optimization (ACO) for VANET named ACONET. This algorithm forms optimized clusters to offer robust communication for VANETs. For optimized clustering, parameters of transmission range, direction, speed of the nodes and load balance factor (LBF) are considered. The ACONET is compared empirically with state of the art methods, including Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) based clustering techniques. An extensive set of experiments is performed by varying the grid size of the network, the transmission range of nodes, and total number of nodes in network to evaluate the effectiveness of the algorithms in comparison. The results indicate that the ACONET has significantly outperformed the competitors.

• Structural Engineering and Mechanics
• /
• v.62 no.6
• /
• pp.709-717
• /
• 2017

This paper develops a two-stage method for structural damage identification by using modal data. First, the Residual Force Vector (RFV) is introduced to detect any potentially damaged elements of structures. Second, data of the frequency domain are used to build up the objective function, and then the Imperialist Competitive Algorithm (ICA) is utilized to estimate damaged extents. ICA is a heuristic algorithm with simple structure, which is easy to be implemented and it is effective to deal with high-dimension nonlinear optimization problem. The advantages of this present method are: (1) Calculation complexity can be decreased greatly after eliminating many intact elements in the first step. (2) Robustness, ICA ensures the robustness of the proposed method. Various damaged cases and different structures are investigated in numerical simulations. From these results, anyone can point out that the present algorithm is effective and robust for structural damage identification and is also better than many other heuristic algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.

• Structural Engineering and Mechanics
• /
• v.82 no.5
• /
• pp.667-678
• /
• 2022

Moment-resisting frames (MRFs) are among the most conventional steel structures for mid-rise buildings in many earthquake-prone cities. Here, a simplified performance-based methodology is proposed for the seismic collapse capacity assessment of these buildings. This method employs a novel multi-mode pushover analysis to determine the engineering demand parameters (EDPs) of the regular steel MRFs up to the collapse prevention (CP) performance level. The modal combination coefficients used in the proposed pushover analysis, are obtained from two metaheuristic optimization algorithms and a fitting procedure. The design variables for the optimization process are the inter-story drift ratio profiles resulting from the multi-mode pushover analyses, and the objective values are the outcomes of the incremental dynamic analysis (IDA). Here, the collapse capacity of the structures is assessed in three to five steps, using a modified IDA procedure. A series of regular mid-rise steel MRFs are selected and analyzed to calculate the modal combination coefficients and to validate the proposed approach. The new methodology is verified against the current existing approaches. This comparison shows that the suggested method more accurately evaluates the EDPs and the collapse capacity of the regular MRFs in a robust and easy to implement way.