Hyungjoo Cha

Mr. Hyungjoo Cha


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 November 2023 in Sustainability
Verified
Journal Article
Open access
PDF file
CKChong-Keun Kim
Chong-Keun Kim
CLChanho Lee
Chanho Lee
DKDongKyun Kim
DongKyun Kim
HCHyungjoo Cha
Hyungjoo Cha
Taesu CheongTaesu Cheong
Taesu Cheong
This paper presents a two-stage mathematical model aimed at enhancing supply chain efficiency by evaluating multiple sourcing strategies and optimizing extra procurement. In the first stage, the model minimizes the gap between Sales and Operation Planning (SOP) and maximum product quantity achievable with current inventory levels, setting the foundation for understanding resource requirements. The second stage focuses on extra procurement strategy optimization, considering lead times, cost-effectiveness. We analyze the trade-offs between multiple sourcing and single vendor approaches, providing valuable insights for supply chain decision-makers. This research offers a practical framework to improve supply chain efficiency, reduce gaps, and enhance customer satisfaction while strengthening supply chain resilience in the face of unforeseen challenges, as demonstrated by the lessons from the COVID-19 pandemics.

16 April 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
HCHyungjoo Cha
Hyungjoo Cha
CLChanho Lee
Chanho Lee
CXChi Xie
Chi Xie
QLQing-Chang Lu
Qing-Chang Lu
JEJoonyup Eun
Joonyup Eun
Taesu CheongTaesu Cheong
Taesu Cheong
The hazardous material transportation requires extensive care owing to the disastrous consequences of accidents, such as chemical spills or radioactive exposures. Consequently, a minimum risk delivery plan that is dynamically decided by the cargo load of the vehicle at each customer must be scheduled. We introduce a traveling salesman problem (TSP) with a sequence-and-load dependent risk, which differs from the conventional TSP as the arc costs are determined by the hazardous cargo load at each decision epoch. We define our problem in a dynamic programming formulation and present mixed-integer linear program with a nonlinear objective function. To efficiently retrieve exact optimal solutions, we propose an iterative-deepening A*-based tree search algorithm using admissible lower and efficient upper bound algorithms for guaranteed optimality. Numerical experiments indicate that the proposed algorithm outperforms a current state-of-the-art solver. An ablation study and sensitivity analysis demonstrate the effectiveness of the proposed algorithm and derive managerial insights.

3 September 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
HKHyungju Kim
Hyungju Kim
HCHyungjoo Cha
Hyungjoo Cha
Taesu CheongTaesu Cheong
Taesu Cheong
This study focused on the challenges posed by the fluctuating demand for COVID-19 vaccines, considering factors such as side effects, religious objections, and absenteeism, which result in the accumulation of excess vaccines. Recognizing the resulting social, economic, and environmental issues, this study investigated the application of a lateral transshipment policy for the management of the inventory of short-term vaccines, considering related unpredictabilities. A discrete event simulation built on foundational principles derived from a mixed-integer linear programming model was employed to explore the dynamics of mRNA-based vaccine distribution among two hospitals based on lateral transshipment and reordering policies. Through the simulation of various scenarios over periods of 1-30 days, transshipment based on the availability policy is employed to determine the quantity of vaccines to be transshipped, constrained to vial amounts, and the (s, S) inventory system for reordering. The results of this study underscore the efficacy of lateral transshipment, particularly in situations where demand discrepancies exist between hospitals, thereby revealing its superiority over non-transshipment strategies within 7 days.

12 December 2025 in IEEE Access
Verified
Journal Article
Open access
JLJunghwa Lee
Junghwa Lee
WCWonhee Cho
Wonhee Cho
HCHyungjoo Cha
Hyungjoo Cha
Taesu CheongTaesu Cheong
Taesu Cheong
In this paper, we propose a three-dimensional shortest path problem for exhaust pipe routing in the semiconductor fabrication industry, involving a single origin and multiple candidate destinations. While previous studies have addressed variations of the shortest path problem, this study extends it into a three-dimensional space in semiconductor fabrication factory, incorporating calculations for pressure loss due to pipe length and multiple types of bend angles, obstacle avoidance, and relevant safety standards for industrial applications. Given the increasing complexity and frequent layout changes in modern semiconductor fabrication facilities, efficient and automated pipe routing has become a crucial task to reduce rework, installation time, and safety risks. To solve this problem, we developed a mixed-integer linear programming (MILP) model. Given its computational complexity, we propose a Pressure-based A* algorithm with a Divide-and-Conquer strategy (PA*-DC), which iteratively applies the 3D Pipe Routing A* (3DP_A*) algorithm. We validated the algorithms through computational experiments using a real-world dataset provided by Samsung Electronics and compared the results with current industry de facto standards for pipe design in actual fabrication facilities. Experimental results confirm that the proposed PA*-DC algorithm achieves high-quality routes and improves pressure efficiency by up to 53.20%, demonstrating its practicality for real-world applications.

20 February 2026 in IEEE Access
Verified
Journal Article
Open access
MCMinseo Choi
Minseo Choi
HCHyungjoo Cha
Hyungjoo Cha
Taesu CheongTaesu Cheong
Taesu Cheong
In response to the rapid growth of e-commerce and the resulting operational challenges in urban last mile logistics, this study introduces the Multi-period Multi-depot Vehicle Routing Problem with Mobile Center (MPMDVRP-MC). The proposed model jointly determines, over multiple periods, which candidate depot sites to activate for deploying mobile centers, how to assign customers to the activated sites, and how to construct capacity-feasible delivery routes, while allowing mobile centers to be opened, closed, and repositioned across days to respond to time-varying demand.We develop a mixed-integer linear programming (MILP) formulation and a genetic algorithm-based heuristic tailored to this multi-period setting. Computational experiments on adapted Solomon benchmark instances [1] show that the heuristic matches or closely approximates MILP solutions on small instances and produces high-quality solutions on larger instances where the MILP frequently reaches the time limit or fails to prove optimality. Sensitivity analyses further reveal systematic trade-offs among travel, opening/operating, and repositioning costs, clarifying when the system behaves as a mobile, adaptive network versus a more static depot configuration. A case study using public parking-lot data from Seoul provides a proof-of-concept illustration of how repositioning can reduce travel costs under shifting demand patterns. Beyond cost efficiency, the mobile-center paradigm combined with light electric delivery modes has potential implications for reducing reliance on heavy vehicles in dense urban areas with fixed depot positions, which we discuss as a qualitative motivation.

15 February 2022 in Journal of Korean Institute of Industrial Engineers
Verified
Journal Article
Closed access
HCHyungjoo Cha
Hyungjoo Cha
DKDongKyun Kim
DongKyun Kim
BSBokyeong Song
Bokyeong Song
CLChungmok Lee
Chungmok Lee
This paper considers a novel vehicle routing problem with micro-mobility delegations. Recently, micro-mobility vehicles such as electric scooters and bicycles are gaining popularity thanks to advancements in battery and electric motor technologies. Most of the previous studies on the micro-mobility in the literature have been focusing on personal transportation applications. However, few studies investigate the use of the micro-mobility in the logistic context mainly because the micro-mobility has limited travel range and relatively low speed. We propose a combined approach of the micro-mobility and the conventional larger vehicles to mitigate drawbacks of the micro-mobility. Specifically, we assume that micro-mobility can be carried in the vehicles and deployed for the delivery as delegations. A mixed-integer programming formulation is presented, and recognizing the problem