• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1106-1110
• /
• 2010

This paper proposes a method of optimizing a stacking strategy for an automated container terminal using multi-objective evolutionary algorithms (MOEAs). Since the yard productivities of seaside and landside are conflicting objectives to be optimized, it is impossible to maximize them simultaneously. Therefore, we derive a Pareto optimal set instead of a single best solution using an MOEA. Preliminary experiments showed that the population is frequently stuck in local optima because of the difficulty of the given problem depending on the yard occupancy rate. To cope with this problem, we propose another method of simultaneously optimizing two problems with different difficulties so that diverse solutions can be preserved in the population. Experimental results showed the proposed method can derive better stacking policies than the compared method solving a single problem given the same computational costs.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.399-404
• /
• 2002

Analyzing acoustic-structural systems such as automobiles and aircraft the FRF-based substructuring method is one of the most powerful tools. In this paper, an optimization procedure far the engine mount system of passenger car has been presented using the design sensitivity analysis based on the multi-domain FRF-based substructuring formulation. The proposed method is applied to an optimization problem of the engine mount system, of which objective is to minimize the interior sound over the concerned rpm range. The design variables selected are the stiffnesses of the engine mounts and bushes. Plugging the gradient information calculated by the proposed method into nonlinear optimization software, we can obtain the optimal stiffnesses of the engine mounts and bushings through design iterations. The optimized interior noise in the passenger car shows that the proposed method is very useful in the realistic situation.

• Smart Structures and Systems
• /
• v.16 no.2
• /
• pp.243-262
• /
• 2015

Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.491-496
• /
• 2002

Multi-objective Optimization Problems(MOPs) are occur more frequently than generally thought when we try to solve engineering problems. In the real world, the majority cases of optimization problems are the problems composed of several competitive objective functions. In this paper, we introduce the definition of MOPs and several approaches to solve these problems. In the introduction, established optimization algorithms based on the concept of Pareto optimal solution are introduced. And contrary these algorithms, we introduce theoretical backgrounds of Nash Genetic Algorithm(Nash GA) and Evolutionary Stable Strategy(ESS), which is the basis of Co-evolutionary algorithm proposed in this paper. In the next chapter, we introduce the definitions of MOPs and Pareto optimal solution. And the architecture of Nash GA and Co-evolutionary algorithm for solving MOPs are following. Finally from the experimental results we confirm that two algorithms based on Evolutionary Game Theory(EGT) which are Nash GA and Co-evolutionary algorithm can search optimal solutions of MOPs.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.7
• /
• pp.535-540
• /
• 2019

The coupling between different models for MDO (Multi-disciplinary Optimization) greatly increases the complexity of the computational framework, while at the same time increasing CPU time and memory usage. To overcome these difficulties, POD (Proper Orthogonal Decomposition) and RBF (Radial Basis Function) are used to solve the optimization problem of determining the thickness of composites and sandwich cores when composite sandwich structures are used as aircraft wing skin materials. POD and RBF are used to construct surrogate models for the wing shape and the load data. Optimization is performed using the objective function and constraint function values which are obtained from the surrogate models.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.447-448
• /
• 2013

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.1-10
• /
• 2015

In this paper, we consider multi-item inventory management. When managing a multi-item inventory, we coordinate replenishment orders of items supplied by the same supplier. The associated problem is called the joint replenishment problem (JRP). One often-used approach to the JRP is to apply a can-order policy. Under a can-order policy, some items are re-ordered when their inventory level drops to or below their re-order level, and any other item with an inventory level at or below its can-order level can be included in this order. In the present paper, we propose a method for finding the optimal parameter of a can-order policy, the can-order level, for each item in a lost-sales model. The main objectives in our model are minimizing the number of ordering, inventory, and shortage (i.e., lost-sales) respectively, compared with the conventional JRP, in which the objective is to minimize total cost. In order to solve this multi-objective optimization problem, we apply a genetic algorithm. In a numerical experiment using actual shipment data, we simulate the proposed model and compare the results with those of other methods.

• Earthquakes and Structures
• /
• v.17 no.1
• /
• pp.63-73
• /
• 2019

This paper studies damage detection as an optimization problem. A new objective function based on changes in natural frequencies, and Natural Frequency Vector Assurance Criterion (NFVAC) was developed. Due to their easy and fast acquisition, natural frequencies were utilized to detect structural damages. Moreover, they are sensitive to stiffness reduction. The method presented here consists of two stages. Firstly, Finite Element Model (FEM) is updated. Secondly, damage severities and locations are determined. To minimize the proposed objective function, a new bio-inspired optimization algorithm called salp swarm was employed. Efficiency of the method presented here is validated by three experimental examples. The first example relates to three-story shear frame with two single damage cases in the first story. The second relates to a five-story shear frame with single and multiple damage cases in the first and third stories. The last one relates to a large-scale eight-story shear frame with minor damage case in the first and third stories. Moreover, the performance of Salp Swarm Algorithm (SSA) was compared with Particle Swarm Optimization (PSO). The results show that better accuracy is obtained using SSA than using PSO. The obtained results clearly indicate that the proposed method can be used to determine accurately and efficiently both damage location and severity in multi-story shear frames.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.10a
• /
• pp.475-480
• /
• 1997

In order to conduct the effective integration of computer-aided conceptual design for integrated nuclear power reactor, not only is a smooth information flow required, but also decision making fur both conceptual design and construction process design must be synthesized. In addition to the aboves, the relations between the one step and another step and the methodologies to optimize the decision variables are verified, in this paper especially, that is, scaling laws and scaling criteria. In the respect with the running of the system, the integrated optimization process is proposed in which decisions concerning both conceptual design are simultaneously made. According to the proposed reactor types and power levels, an integrated optimization problems are formulated. This optimization is expressed as a multi-objective optimization problem. The algorithm for solving the problem is also presented. The proposed method is applied to designing a integrated sub-critical reactors.