• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.114-116
• /
• 2015

This paper presents a Stochastic Time-Cost Tradeoff analysis system (STCT) that identifies optimal construction methods for activities, hence reducing the project completion time and cost simultaneously. It makes use of schedule information obtained from critical path method (CPM), applies alternative construction methods data obtained from estimators to respective activities, computes an optimal set of genetic algorithm (GA) parameters, executes simulation based GA experiments, and identifies near optimal solution(s). A test case verifies the usability of STCT.

• Smart Structures and Systems
• /
• v.17 no.5
• /
• pp.709-724
• /
• 2016

This study investigates the optimum design parameters of a superelastic friction base isolator (S-FBI) system through a multi-objective genetic algorithm to improve the performance of isolated buildings against near-fault earthquakes. The S-FBI system consists of a flat steel-PTFE sliding bearing and superelastic NiTi shape memory alloy (SMA) cables. Sliding bearing limits the transfer of shear across the isolation interface and provides damping from sliding friction. SMA cables provide restoring force capability to the isolation system together with additional damping characteristics. A three-story building is modeled with S-FBI isolation system. Multiple-objective numerical optimization that simultaneously minimizes isolation-level displacements and superstructure response is carried out with a genetic algorithm in order to optimize S-FBI system. Nonlinear time history analyses of the building with optimal S-FBI system are performed. A set of 20 near-fault ground motion records are used in numerical simulations. Results show that S-FBI system successfully control response of the buildings against near-fault earthquakes without sacrificing in isolation efficacy and producing large isolation-level deformations.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.788-791
• /
• 2003

Optimal loudspeaker positions are important as much as the control algorithms and hardware performance in the active noise control system. This study is similar to the past researches on the optimal transducer locations but with a far field noise source having a plane wave characteristic and the noise coming through an opening such as a window in the enclosure. An optimization technique called simulated annealing algorithm is used to find a set of optimal loudspeaker positions from a larger possible loudspeaker positions. Loudspeakers are placed on the surface of opening at the wail. Using the measured acoustic transfer impedances and numerical simulations with the optimization technique, optimal positions we identified and compared. When a small number of loudspeakers are used, loudspeaker positions on the opening near the center seems to be the best place, but when a larger number of loudspeakers are used it was difficult to find simple patterns Un the optimal positions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.141-157
• /
• 2004

In this paper, we consider broadband satellite systems using MF-TDMA(Multi-Frequency Time Division Multiple Access) scheme. First, we analyze return link, superframe structure, and QoS( Quality of Service) parameters in broadband satellite systems, and mathematically formulate the QoS-based optimal timeslot allocation problem as a nonlinear integer programming problem for broadband satellite systems with clear-sky and rain-fade satellite terminals, and multiple data classes. Next, we modify the proposed problem to solve it within in a fast time, and suggest the QoS-based optimal timeslot allocation scheme. Extensive simulation results show that the proposed scheme finds an optimal solution or a near optimal solution within 5ms at Pentium IV PC.

• Earthquakes and Structures
• /
• v.22 no.1
• /
• pp.53-64
• /
• 2022

This study proposes an intelligent semi-active isolation system combining a variable-stiffness control device and ground motion characteristic prediction. To determine the optimal control parameter in real-time, a genetic algorithm (GA)-fuzzy control law was developed in this study. Data on various types of ground motions were collected, and the ground motion characteristics were quantified to derive a near-fault (NF) characteristic ratio by employing an on-site earthquake early warning system. On the basis of the peak ground acceleration (PGA) and the derived NF ratio, a fuzzy inference system (FIS) was developed. The control parameters were optimized using a GA. To support continuity under near-fault and far-field ground motions, the optimal control parameter was linked with the predicted PGA and NF ratio through the FIS. The GA-fuzzy law was then compared with other control laws to verify its effectiveness. The results revealed that the GA-fuzzy control law could reliably predict different ground motion characteristics for real-time control because of the high sensitivity of its control parameter to the ground motion characteristics. Even under near-fault and far-field ground motions, the GA-fuzzy control law outperformed the FPEEA control law in terms of controlling the isolation layer displacement and the superstructure acceleration.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.922-931
• /
• 2012

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4987-5005
• /
• 2017

This paper introduces a new method to solve Similarity Recognition for Cloth Products, which is based on Fuzzy logic and Particle swarm optimization algorithm. For convenience, it is called the SRCPFP method hereafter. In this paper, the SRCPFP method combines Fuzzy Logic (FL) and Particle Swarm Optimization (PSO) algorithm to solve similarity recognition for cloth products. First, it establishes three features, length, thickness, and temperature resistance, respectively, for each cloth product. Subsequently, these three features are engaged to construct a Fuzzy Inference System (FIS) which can find out the similarity between a query cloth and each sampling cloth in the cloth database D. At the same time, the FIS integrated with the PSO algorithm can effectively search for near optimal parameters of membership functions in eight fuzzy rules of the FIS for the above similarities. Finally, experimental results represent that the SRCPFP method can realize a satisfying recognition performance and outperform other well-known methods for similarity recognition under considerations here.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• The Korean Journal of Applied Statistics
• /
• v.22 no.6
• /
• pp.1277-1287
• /
• 2009

For stratifying skewed populations, the Lavall$\acute{e}$e-Hidiroglou(LH) algorithm is often considered to have a take-all stratum with the largest units and some take-some strata with the middle-size and small units. Related to its iterative nature have been reported some numerical difficulties such as the dependency of the ultimate stratum boundaries to a choice of initial boundaries and the slow convergence to locally-optimum boundaries. The geometric stratification has been recently proposed to provide initial boundaries that can avoid such numerical difficulties in implementing the LH algorithm. Since the geometric stratification does not pursuit the optimization but the equalization of the stratum CVs, the corresponding stratum boundaries may not be (near) optimal. This paper revisits these issues concerning convergence and near-optimality of optimal stratification algorithms using artificial numerical examples. We also discuss the formation of the strata and the sample allocation under the optimization process and some aspects related to discontinuity arisen from the finiteness of both population and sample as well.

• Journal of the military operations research society of Korea
• /
• v.24 no.2
• /
• pp.146-161
• /
• 1998

This article develops model of the nonstationary state behavior of the multiechelon spare parts provisioning systems. This study is concerned with a problem of determining the near optimal requirements level of the spare parts, especially Concurrent Spare Parts(CSP). CSP is supplied with the procurement of new equipment system, and is used to sustain the equipment without resupply during the initial coverage period. We consider this situation as a multiechelon inventory model with several bases and one depot. And we assume an equipment system which consists of many types of parts would grounded if one of the parts fail. Also this multiechelon CSP problem is considering the nonstationary poisson failure process and nonstationary exponential repair process in a dynamic environment. We develop an efficient computational procedure to find the near optimal number of spare parts minimizing the total expected cost, while achieving the required system availability. Finally we present a simple example of suggested method.