• Journal of the Earthquake Engineering Society of Korea
• /
• v.6 no.2
• /
• pp.63-71
• /
• 2002

This paper examines the ASCE first generation benchmark problem for a seismically excited cable-stayed bridge, and proposes a new semi-active control strategy focusing on inclusion of effects of control-structure interaction. This benchmark problem focuses on a cable-stayed bridge in Cope Girardeau, Missouri, USA, for which construction is expected to be completed in 2003. Seismic considerations were strongly considered in the design of this bridge due to the location of the bridge in the New Madrid seismic zone and its critical role as a principal crossing of the Mississippi River. In this paper, magnetorheological(MR) fluid dampers are proposed as the supplemental damping devices, and a clipped-optimal control algorithm is employed. Several types of dynamic models for MR fluid dampers, such as a Bingham model, a Bouc-Wen model, and a modified Bouc-Wen model, are considered, which are obtained from data based on experimental results for full-scale dampers. Because the MR fluid damper is a controllable energy-dissipation device that cannot add mechanical energy to the structural system, the proposed control strategy is fail-safe in that bounded-input, bounded-output stability of the controlled structure is guaranteed. Numerical simulation results show that the performance of the proposed semi-active control strategy using MR fluid dampers is quite effective.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.8
• /
• pp.1004-1009
• /
• 2014

The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.198-206
• /
• 2013

The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.423-432
• /
• 2014

Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.36-42
• /
• 2021

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1995.10a
• /
• pp.85-90
• /
• 1995

A characteristic transport theory code CRX is developed and tested for cell and assembly calculations. Since the characteristic method treats explicitly (analytically) the streaming portion of the transport equation, CRX treats strong absorbers well and has no practical limitations placed on the geometry of the problem. To test the code, it was applied to three benchmark problems which consist of complex meshes and compared with other codes.

• Architectural research
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2015

A simple force-finding process based on an optimization technique is proposed for tensegrity structures. For this purpose, the inverse problem of form-finding process is formulated. Therefore, the position vector of nodes and element connectivity information are provided as priori. Several benchmark tests are carried out to demonstrate the performance of the present force-finding process. In particular, the force density distributions of simplex tensegrity are thoroughly investigated with the important parameters such as the radius, height and twisting angle of simplex tensegrity. Finally, the force density distribution of arch tensegrity is produced by using the present force-finding process for a future reference solution.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.47-53
• /
• 1995

The Generalized Assignment (GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• Nuclear Engineering and Technology
• /
• v.44 no.2
• /
• pp.151-160
• /
• 2012

The advantages for using Monte Carlo methods to analyze full-core reactor configurations include essentially exact representation of geometry and physical phenomena that are important for reactor analysis. But this substantial advantage comes at a substantial cost because of the computational burden, both in terms of memory demand and computational time. This paper focuses on the challenges facing full-core Monte Carlo for keff calculations and the prospects for Monte Carlo becoming a routine tool for reactor analysis.