Sang Hyun Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sang Hyun Kim has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
Eric Feron
Georgia Institute of Technology, Atlanta, Georgia 30332
11 shared publicationsJohn-Paul Clarke
Georgia Institute of Technology, Atlanta, Georgia 30332
4 shared publicationsByeong Tak Park
KT Corporation
3 shared publications- Munhyun Chae
School of Air Transport, Transportation, and Logistics, Korea Aerospace University, Goyang, Republic of Korea
3 shared publications Hyeju Oh
Inha Univ, Dept Aerosp Engn, 100 Inha Ro, Incheon 22212, South Korea
2 shared publicationsHyejung Hong
Korea Transport Inst, Sejong 30147, South Korea
2 shared publications
Latest Publications
- 11 November 2026
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 216
Ground risk-based airspace capacity assessment for small unmanned aircraft in urban environments
- 11 November 2026
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 216
Ground risk-based airspace capacity assessment for small unmanned aircraft in urban environments
- 1 March 2026
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 23 (3) , 257-270
Adaptive Policy Optimization for Battery-Constrained Drone Delivery Routing
This study addresses a drone delivery routing optimization problem with battery constraints, a variant of a vehicle routing problem (VRP), where drones deliver goods to multiple customer nodes while adhering to operational limitations such as battery and payload capacities. Our study proposes Adaptive-Policy Optimization with Multiple Optima (A-POMO), an enhanced framework based on POMO, which is a reinforcement-learning-based method for solving combinatorial optimization problems like VRP without relying on labeled data. A-POMO for battery-constrained drone delivery routing improves solution quality and computational efficiency through a constraint-guided probability distribution and an adaptive elite reward mechanism. Especially, A-POMO adjusts reward weights adaptively and employs a refined baseline for elite solutions to strike a balance between exploration and exploitation. Numerical experiments with 20, 50, and 100 customer nodes demonstrate that A-POMO achieves near-optimal solutions compared to MILP, with significant time efficiency for small-scale instances. It also outperforms the original POMO in large-scale instances for constraint-guided route optimization.
- 1 March 2026
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 23 (3) , 257-270
Adaptive Policy Optimization for Battery-Constrained Drone Delivery Routing
This study addresses a drone delivery routing optimization problem with battery constraints, a variant of a vehicle routing problem (VRP), where drones deliver goods to multiple customer nodes while adhering to operational limitations such as battery and payload capacities. Our study proposes Adaptive-Policy Optimization with Multiple Optima (A-POMO), an enhanced framework based on POMO, which is a reinforcement-learning-based method for solving combinatorial optimization problems like VRP without relying on labeled data. A-POMO for battery-constrained drone delivery routing improves solution quality and computational efficiency through a constraint-guided probability distribution and an adaptive elite reward mechanism. Especially, A-POMO adjusts reward weights adaptively and employs a refined baseline for elite solutions to strike a balance between exploration and exploitation. Numerical experiments with 20, 50, and 100 customer nodes demonstrate that A-POMO achieves near-optimal solutions compared to MILP, with significant time efficiency for small-scale instances. It also outperforms the original POMO in large-scale instances for constraint-guided route optimization.
- 6 January 2026
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (10) , 3062-3085
Optimal multi-floor vertiport layout design
- 6 January 2026
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (10) , 3062-3085
Optimal multi-floor vertiport layout design
- Open Access
- 19 September 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (3) , 1-32
Capacitated p-hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches
By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.
- 19 September 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (3) , 1-32
Open AccessCapacitated p-hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches
By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.
- 24 August 2024
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 26 (3) , 1293-1308
Optimal Vertiport Locations for Air Taxi Services in Seoul Metropolitan Area
- 24 August 2024
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 26 (3) , 1293-1308
Optimal Vertiport Locations for Air Taxi Services in Seoul Metropolitan Area
- 28 July 2024
- Published by Elsevier in Journal of Air Transport Management
- Vol. 119
Potential market based policy considerations for urban air mobility
- 28 July 2024
- Published by Elsevier in Journal of Air Transport Management
- Vol. 119
Potential market based policy considerations for urban air mobility
- 23 September 2023
- Published by Elsevier in Sustainable Cities and Society
- Vol. 99
Integrated Mobility Hub Location Selection for Sustainable Urban Mobility
- 23 September 2023
- Published by Elsevier in Sustainable Cities and Society
- Vol. 99
Integrated Mobility Hub Location Selection for Sustainable Urban Mobility
- 13 September 2022
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 24 (1) , 320
Correction to: Vertiport Performance Analysis for On-Demand Urban Air Mobility Operation in Seoul Metropolitan Area
- 13 September 2022
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 24 (1) , 320
Correction to: Vertiport Performance Analysis for On-Demand Urban Air Mobility Operation in Seoul Metropolitan Area
- 8 August 2022
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 23 (5) , 1065-1078
Vertiport Performance Analysis for On-Demand Urban Air Mobility Operation in Seoul Metropolitan Area
- 8 August 2022
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 23 (5) , 1065-1078
Vertiport Performance Analysis for On-Demand Urban Air Mobility Operation in Seoul Metropolitan Area
- 1 July 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 19 (7) , 494-503
Pretactical Runway Operations Scheduling for Multirunway Airport
Airport runway operations are managed hierarchically. Initially, a runway configuration is determined several hours before the commencement of actual runway operations. Thereafter, each aircraft is...
- 1 July 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 19 (7) , 494-503
Pretactical Runway Operations Scheduling for Multirunway Airport
Airport runway operations are managed hierarchically. Initially, a runway configuration is determined several hours before the commencement of actual runway operations. Thereafter, each aircraft is...