• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1782-1793
• /
• 1989

Stroke crossing number, syntactic pattern recognition procedure, top down recognition structure, and heuristic approach are studied for the Korean text recognition. We propose new algorithms: 1)Korean vowel seperation using limited scanning method in the Korean characters, 2) extracting strokes using stroke width method, 3) stroke crossing number and its properties, 4) average, standard deviation, and mode of stroke crossing number, and 5) classification and recognition methods of limited chinese character. These are studied with computer simuladtions and experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.896-900
• /
• 1988

Tree search can be applied to a control problem if the system is a discrete-time one and if the control input takes only discrete values. This paper considers the application of heuristic tree search to a simple control problem. The results of simulation studies show the good possibility of this approach to a control problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.290-295
• /
• 1989

This paper proposes a Expert CAPP System for integrating CAD/CAM of rotational work-part by rule based approach. The CAD/CAPP integration is performed by the recognition of machined features from the 2-D CAD data (IGES) file. Selecting functions of the process planning are performed in modularized rule base by forward chaining inference, and operation sequences are determined by means of heuristic search algorithm. For CAPP/CAM integration, post-processor generates NC code from route sheet file. This system coded in OPS5 and C language on PC/AT, and EMCO CNC lathe interfaced with PC through DNC and RS-232C.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.800-804
• /
• 1999

An intelligent path planning algorithm for an autonomous cleaning robot is presented. This algorithm recognizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.106-112
• /
• 2004

This paper presents a new heuristic algorithm for the machine cell(MC) formation problem. MC formation problem is represented as an unbalanced k-way network partition and the proposed algorithm uses four stage-approach to solve the problem. Four stages are natural sub-network formation, determination of intial vertexes for each sub-network, determination of initial partition, and improvement of initial partition. Results of experiments show that the suggested algorithm provides near optimal solutions within very short computational time.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.192-199
• /
• 2007

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.83-103
• /
• 1993

This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.

• Journal of the Korean Statistical Society
• /
• v.36 no.4
• /
• pp.479-488
• /
• 2007

The elliptic random field is an extension to the Gaussian random field. We proved a theorem which characterizes the elliptic random field. We proposed a heuristic approach to derive an approximation to the distribution of the size of one connected component of its excursion set above a high threshold. We used this approximation to approximate the distribution of the largest cluster size. We used simulation to compare the approximation with the exact distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.447-460
• /
• 1996

Network optimization and design procedures often separate quality of service (QOS) performance measures from reliability issues. This paper considers channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assingments are determined which minimize network cost while maintaining QOS performance requirements. this approach is shown to yield significant network cost reductions compared to previous heuristic methods used in the design of packet switched network with unreliable links.