• Management Science and Financial Engineering
• /
• v.6 no.2
• /
• pp.47-67
• /
• 2000

It is discussed how to assign delivery tasks to automated guided vehicles (AGVs) for multiple container cranes in automated container terminals. The primary goal of dispatching AGVs is to complete all the lading and discharging operations as early as possible, and the secondary goal is to minimize the total travel distance of AGVs. It is assumed that AGVs are not dedicated to a specific container crane but shared among multiple cranes. A mathematical formulation is developed and a heuristic algorithm is suggested to obtain a near optimal solution with a reasonable amount of computational time. The single-cycle and the dual-cycle operations in both the seaside and the landside operations are analyzed. The effects of pooling AGVs for multiple container cranes on the performance of an entire AGV system are also analyze through a numerical experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2B
• /
• pp.137-144
• /
• 2002

In this paper, we optimize the base station placement and transmission power using genetic approach. A new representation describing base station placement and transmit power with real number is proposed, and new genetic operators are introduced. This new representation can describe the locations, powers, and number of base stations, Considering coverage, power and economy efficiency, we also suggest a weighted objective function. Our algorithm is applied to an obvious optimization problem, and then it is verified. Moreover, our approach is tried in inhomogeneous traffic distribution. Simulation result proves that the algorithm enables to fad near optimal solution according to the weighted objective function.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.123-132
• /
• 1987

In this paper, we studied on the design of elliptic digital filters using the bilinear z transformation method, and proposed a design procedure satisfying prescribed specifications. The magnitude characteristics of digital filters are compared with its of analog filiters by computer simulation. Finaly we considered the quantization effects of digital filters. In cascader realization of fixed-point digital filters under dynamic range constraints, the outpout noise for IIR digital filters depends on the pole-zero pairing and ordering of the second order sections. Therfore an optmization procedure to finding a good ordering and pairing is very desirable. Thus, we proposed a sub-optimization procedure for finding "near optimal" solution.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.3
• /
• pp.441-453
• /
• 2017

In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• Journal of the Korean Society of Tobacco Science
• /
• v.25 no.1
• /
• pp.53-58
• /
• 2003

This study deals with the leaf tobacco assignment problem of a leaf tobacco warehouse with multiple input points and single output point. Also, the number of storage frequences is not necessary the same as that of retrieval for each leaf tobacco. A mathematical model is developed with the objective of minimizing the total travel distance associated with storage and retrieval operations. We also develop several heuristics based on the retrieval order frequency, retrieval/storage frequency ratio of leaf tobacco, and ABC curve. It is observed that the ABC curve based heuristic gives the best solution which is near optimal. Based on the test results from real world data, the ABC curve based heuristic is found to give a best performance. Comparing to current assignment method, the ABC curve based heuristic reduced total travel distance about 17.2%.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.249-253
• /
• 2004

Wavelet transform (WT) has attracted most engineers and scientists because of its excellent properties. The coherence of practical approach and a theoretical basis not only solves currently important problems, but also gives the potential of formulating and solving completely new problems. It has been show that multi-resolution analysis of Wavelet transforms is good solution in speech analysis and threshold of wavelet coefficients has near optimal noise reduction property for many classes of signals. This paper proposed applications of wavelet in speech processing: pitch detection, voice-unvoice (V -UV) decision, denoising with the detailed algorithms and results.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.28-35
• /
• 1997

A new approach concurrent transistor sizing and buffer insertion for low power optimization is proposed in this paper. The method considers the tradeoff between upsizing transistors and inserting buffers and chooses the solution with the lowest possible power and area cost. It operates by analyzing the feasible region of the cost-delay curves of the unbuffered and buffered circuits. As such the feasible region of circuits optimized by our method is extended to encompass the envelop of cost-delay curves which represent the union of the feasible regions of all buffered ad unbuffered versions of the circuit. The method is efficient and tunable in that optimality can be traded for compute time and as a result it can in theory near optimal results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.539-544
• /
• 2003

The weapon-target assignment problem is solved using a genetic algorithm in this paper. The weapon-target assignment is an optimization problem which minimizes damages from enemy s attack or maximizes the kill probability of targets. Genetic algorithm is applied in this paper since it usually converges to a near global optimal solution. A specific structure of genetic algorithm which is suitable for the weapon-target assignment problem is proposed. A guideline selecting associated parameters is investigated through simulations. Comparition of the proposed method with several traditional optimization techniques for the weapon-target assignment problem shows the validity of the proposed method.