• 산업공학
• /
• 제20권4호
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• Structural Engineering and Mechanics
• /
• 제72권2호
• /
• pp.181-190
• /
• 2019

Topology optimization of structures seeking the best distribution of mass in a design space to improve the structural performance and reduce the weight of a structure is one of the most comprehensive issues in the field of structural optimization. In addition to structures stiffness as the most common objective function, frequency optimization is of great importance in variety of applications too. In this paper, an efficient multi-objective Bi-directional Evolutionary Structural Optimization (BESO) method is developed for topology optimization of frequency and stiffness in continuum structures simultaneously. A software package including a Matlab code and Abaqus FE solver has been created for the numerical implementation of multi-objective BESO utilizing the weighted function method. At the same time, by considering the weaknesses of the optimized structure in single-objective optimizations for stiffness or frequency problems, slight modifications have been done on the numerical algorithm of developed multi-objective BESO in order to overcome challenges due to artificial localized modes, checker boarding and geometrical symmetry constraint during the progressive iterations of optimization. Numerical results show that the proposed Multiobjective BESO method is efficient and optimal solutions can be obtained for continuum structures based on an existent finite element model of the structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• 대한기계학회논문집A
• /
• 제26권10호
• /
• pp.2150-2158
• /
• 2002

A recent research and development has the requirement for the optimization to shorten design time of modified or new product model and to obtain more precise engineering solution. General optimization problem must consider many conflicted objective functions simultaneously. Multi-objective optimization treats the multiple objective functions and constraints with design change. But, real engineering problem doesn't describe accurate constraint and objective function owing to the limit of representation. Therefore this study applies variance analysis on the basis of structure analysis and DOE to the vertical roller mill fur portland cement and proposed statistical design model to evaluate the effect of structural modification with design change by performing practical multi-objective optimization considering mass, stress and deflection.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1296-1299
• /
• 1996

This paper proposes a design automation method for the flight control system of an aircraft based on optimization. The control system design problem which has many specifications is formulated as multi-objective optimization problem. The solution of this optimization problem should be considered in terms of Pareto-optimality. In this paper, we use an evolutionary algorithm providing numerous Pareto-optimal solutions. These solutions are given to a control system designer and the most suitable solution is selected. This method decreases tasks required to determine the control parameters satisfying all specifications. The design automation of a flight control system is illustrated through an example.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.77-91
• /
• 2007

In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

• Journal of Information Processing Systems
• /
• 제17권2호
• /
• pp.426-439
• /
• 2021

To alleviate the cold-start problem and data sparsity in web service recommendation and meet the personalized needs of users, this paper proposes a personalized web service recommendation method based on a hybrid social network and multi-objective immune optimization. The network adds the element of the service provider, which can provide more real information and help alleviate the cold-start problem. Then, according to the proposed service recommendation framework, multi-objective immune optimization is used to fuse multiple attributes and provide personalized web services for users without adjusting any weight coefficients. Experiments were conducted on real data sets, and the results show that the proposed method has high accuracy and a low recall rate, which is helpful to improving personalized recommendation.

• International Journal of Computer Science & Network Security
• /
• 제22권6호
• /
• pp.203-211
• /
• 2022

Multi-objective optimization problems (MOPs) arise in many real-world applications. MOPs involve two or more objectives with the aim to be optimized. With these problems improvement of one objective may led to deterioration of another. The primary goal of most multi-objective evolutionary algorithms (MOEA) is to generate a set of solutions for approximating the whole or part of the Pareto optimal front, which could provide decision makers a good insight to the problem. Over the last decades or so, several different and remarkable multi-objective evolutionary algorithms, have been developed with successful applications. However, MOEAs are still in their infancy. The objective of this research is to study how to use and apply machine learning (ML) to improve evolutionary multi-objective optimization (EMO). The EMO method is the multi-objective evolutionary algorithm based on decomposition (MOEA/D). The MOEA/D has become one of the most widely used algorithmic frameworks in the area of multi-objective evolutionary computation and won has won an international algorithm contest.

• Smart Structures and Systems
• /
• 제25권3호
• /
• pp.345-368
• /
• 2020

The present work proposes a self-controlled multi-stage optimization method for damage identification of structures utilizing standard particle swarm optimization (PSO) algorithm. Damage identification problem is formulated as an inverse optimization problem where damage severity in each element of the structure is considered as optimization variables. An efficient objective function is formed using the first few frequencies and mode shapes of the structure. This objective function is minimized by a self-controlled multi-stage strategy to identify and quantify the damage extent of the structural members. In the first stage, standard PSO is utilized to get an initial solution to the problem. Subsequently, the algorithm identifies the most damage-prone elements of the structure using an adaptable threshold value of damage severity. These identified elements are included in the search space of the standard PSO at the next stage. Thus, the algorithm reduces the dimension of the search space and subsequently increases the accuracy of damage prediction with a considerable reduction in computational cost. The efficiency of the proposed method is investigated and compared with available results through three numerical examples considering both with and without noise. The obtained results demonstrate the accuracy of the present method can accurately estimate the location and severity of multi-damage cases in the structural systems with less computational cost.