• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.4
• /
• pp.887-895
• /
• 1995

Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.58-72
• /
• 2009

The main activities of container terminals are to load container freights to vessels, discharge them from vessels, and store them in the storage yard. Container terminals make many operational plans to execute these functions effectively. If the plans do not consider enough the loads of related resources, they may have low actualities. This study discusses the optimal yard planning model which considers various resources, such as the storage yard, yard cranes, internal vehicles, and travel lanes, in container terminals. The model determines the groups and amounts of containers which are stored in each storage block by using the resource profile. The yard planning problem is represented to the multi-commodity minimal cost flow problem and is formulated to the linear programming model. In order to explain the application of the mathematical model, the numerical examples are presented. Additionally, the relationship between the average load ratio and the relocation ratio is discussed.

• Journal of the Korean Society for Precision Engineering
• /
• v.5 no.3
• /
• pp.31-42
• /
• 1988

This paper describes a computer aided process planning system called "Deep-Drawing", "Deep-Drawing" is designed for the drawing sequence of cylindrical and rectangular cups with or without taper and flange. The computer program has written in BASIC language with personal computer. Design Rules for process planning are formulated from process limitation, plasticity theory and experimental results including the know-how of many manufacturing factories. "Deep-Drawing" Capabilities include the analysis of drawing sequence by the determination of optimal drawing ratio, the determination of intermediate shape, dimensions, punch and die radius etc., the calculation of drawing loads and blank holder force to perform each drawing step, and the graphic outputs for the operation sheet.tputs for the operation sheet.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.984-993
• /
• 1992

Fuzzy L.P. with Multi-criteria function is adopted in this VAR planning algorithm to accomplish the optimization of comflicting objectives, such as the amount of the VAR installed and power system loss, while keeping the bus voltage profile within an admissible range. Fuzzy L.P. with Multi-criteria function, a powerful tool dealing with the fuzziness of satisfaction levels of the constraints and the goal of objective functions, enables us to search for the solutions which may contribute in VAR planning. This advantage is not provided by traditional standardized L.P. The effectiveness of the proposed algorithm has been verified by the test on the IEEE-30 bus system.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.2
• /
• pp.32-38
• /
• 1999

An autonomous mobile vehicle for transport system must plan optimal path in work envimnrent without human supervision and obstacle collision. This is to reach a destination without getting lost. In this paper, a genetic algorithm for globaI and local path planning and collision avoidance is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The sinmulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.rithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.111-122
• /
• 2000

This paper considers remanufacturing planning problems under deterministic environments. As increasing the environmental pressures in manufacturing, various methods for reducing wasted or postponing the time to be waste are considered. This paper considers remanufacturing planning problems on a single facility, where the wastes(or used products) are remanufactured to satisfy the given demand on the remanufactured products. The objective is to find the optimal remanufacturing and purchasing planning of the wastes which minimize total cost subject to satisfaction all the given demand on the remanufactured products. Two problems that the amount of wastes is a given constant or a decision variable are considered, respectively. For the problems, the extreme point solutions are characterized, and dynamic programming algorithms are developed with numerical examples.

• Journal of Korean Society for Quality Management
• /
• v.22 no.1
• /
• pp.188-204
• /
• 1994

Most of computer-aided process planning(CAPP) systems have been developed to automate the process planning function. In this paper, we describe an analytical model for a CAPP system in order to improve the performance of production system in flexible manufacturing systems(FMSs) for computer intergrated manufacturing(CIM) architecture. This paper proposes an optimal process planning that minimizes the load time by minimizing the cycle time and the number of workstations using Kang and Hahm's heuristic approach so as to improve the performance of production system under the batch production of discrete products. We also perform simulation using SIMAN language to campare the line utilization of each for various product types. The proposed algorithm can be implemented in existing FMSs for on-line control of product quantity using programmable logic controllers(PLC) and communication devices.

• IE interfaces
• /
• v.5 no.2
• /
• pp.39-52
• /
• 1992

This paper presents alternatives for facilities planning and analyses them using simulation approach. For this purpose, hydro-cylinder production line was sampled as a case study. Several facilities planning alternatives are evaluated based on the several factors such as line balancing, equipment utilization, optimum number of equipments, inventory size, flow time, bottleneck machine, and productive capacity. An optimal facilities planning is proposed based on the degree of meeting with the all factors evaluated. The simulation language employed in this study is SIMAN and the data used for simulation are provided by hydro-cylinder shop.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.26 no.12
• /
• pp.93-98
• /
• 2012

Economics of available alternatives in the transmission planning are evaluated by the investment cost, loss cost and congestion cost. Congestion/loss cost is calculated in many years and many load levels by unit commitment of generators, optimal dispatch, load flow, judgement about transmission congestion and re-dispatch to reduce the congestion. The greatest difficulties to introduce variable optimization techniques on the transmission planning is the convergence of load flow. In this paper, economics in the transmission planning are evaluated using DC load flow, and case study is conducted on the Korea power system by proposed congestion/loss calculation methods.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.