Byungin Kim
Pohang University of Science and Technology · 工学
研究室紹介
Professor Byungin Kim's research lab specializes in intelligent scheduling and control systems for automated manufacturing and material handling environments, with a strong focus on industrial applications in semiconductor fabrication and warehouse logistics. The lab develops hybrid intelligent agent-based architectures that integrate hierarchical and heterarchical control principles to optimize dynamic decision-making in real time. Key research directions include vehicle dispatching, order picking optimization, and efficient resource allocation using advanced algorithms such as the Hungarian algorithm and heuristic-based methods. The lab emphasizes practical implementation through simulation and real-world system analysis to enhance system efficiency and utilization.
Research Overview
Research Output Trend
Figures are computed from collected data and may differ slightly.
Selected Papers
15In this paper, we consider an actual industrial warehouse order picking problem where goods are stored at multiple locations and the pick location of goods can be selected dynamically in near real time. We solve the problem using an intelligent agent-based model. The modeling framework is between the two extremes of hierarchical and heterarchical frameworks. It recognizes that horizontal as well as vertical decisions are made between various levels of controllers and that these have to be captur
In recent years, the hybrid control framework has received attention from the research community. Variations of this control framework are available in the literature. In this paper, a hybrid intelligent agent-based scheduling and control system architecture is presented for an actual industrial warehouse order-picking problem, where goods are stored at multiple locations and the pick location of goods can be selected dynamically in near-real time. The presented architecture includes a higher le
This paper addresses the order picking sequence problem in an automated warehouse where parts of an order picker's travelling tour are fixed, the length of the layout is significantly longer than the width, and the picker can hold only one item at a given time. The problem is to find an optimal sequence with given vertical paths and so it is a special type of travelling salesman problem. A simple sorting-based heuristic and an efficient clustering-based algorithm are developed for this problem.