Hyun Joon Kim
Hanyang University · 工学
研究室紹介
Professor Hyun Joon Kim's research lab specializes in operations research, optimization, and intelligent systems with a focus on sustainable energy systems and industrial process integration. The lab develops decision support systems and advanced algorithms for optimizing complex supply chains—particularly hydrogen refueling and supply networks—while also addressing challenges in manufacturing processes such as steel-making batching and microminiature heat exchanger welding. Research spans mathematical modeling, graph algorithms, and signal fusion techniques to improve efficiency, reliability, and performance in energy and metallurgical industries. The lab emphasizes real-world applicability through prototype development and computational validation.
Research Overview
Research Output Trend
Figures are computed from collected data and may differ slightly.
Selected Papers
15This study presents a novel web-based decision support system (DSS) that optimizes the locations of hydrogen refueling stations (HRSs) and hydrogen supply chains (HSCs). The system is developed with a design science approach that identifies key design requirements and features through interviews and literature reviews. Based on the findings, a system architecture and data model were designed, incorporating scenario management, optimization model, visualization, and data management components. Th
Subgraph matching is the problem of searching for all embeddings of a query graph in a data graph, and subgraph query processing (also known as subgraph search) is to find all the data graphs that contain a query graph as subgraphs. Extensive research has been done to develop practical solutions for both problems. However, the existing solutions still show limited query processing time due to a lot of unnecessary computations in search. In this paper, we focus on exploring as compact search spac
We consider an integrated batching problem for steel-making and continuous casting process of steel plate manufacturing. For steel-making, slab batching problem is defined to make charges from slabs, and for continuous casting, charge batching problem is defined to make casts from charges. Our batching problem is regarded as a combination of slab batching and charge batching problems. Since steel-making and continuous casting are processes that must be synchronised, two batching problems must be
We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cu