Jisoon Lim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jisoon Lim has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Neda Masoud
University of Michigan, Ann Arbor, MI, USA
6 shared publications - Amirmahdi Tafreshian
Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109
2 shared publications - Andre L. Carrel
Department of Civil, Environmental, and Geodetic Engineering, The Ohio State University, Columbus, USA
1 shared publication - Chenhan Li1 shared publication
- Daniel B. Work
Vanderbilt University, USA
1 shared publication - Golbarg Dokhani1 shared publication
Latest Publications
- 17 October 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
A Bayesian-guided aggregation-disaggregation algorithm for transit planning
- 17 October 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
A Bayesian-guided aggregation-disaggregation algorithm for transit planning
- 25 August 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 193
Curb space infrastructure planning under demand uncertainty
- 25 August 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 193
Curb space infrastructure planning under demand uncertainty
- Open Access
- 12 June 2026
- Published by Elsevier in Transportation Research Interdisciplinary Perspectives
- Vol. 38
Enhancing transportation education to reflect technological advancements in connected and automated vehicles
- 12 June 2026
- Published by Elsevier in Transportation Research Interdisciplinary Perspectives
- Vol. 38
Open AccessEnhancing transportation education to reflect technological advancements in connected and automated vehicles
- 13 February 2026
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 206
Spatiotemporal pricing of curb space for improving operator and user utilities
- 13 February 2026
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 206
Spatiotemporal pricing of curb space for improving operator and user utilities
- 8 August 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 203
A microsimulation study of curb space operational strategies and user behaviors
- 8 August 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 203
A microsimulation study of curb space operational strategies and user behaviors
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (6) , 1252-1276
Dynamic Usage Allocation and Pricing for Curb Space Operation
The importance of curbside management is quickly growing in a modernized urban setting. Dynamic allocation of curb space to different usages and dynamic pricing for those usages can help meet the growing demand for curb space more effectively and promote user turnover. To model curbside operations, we formulate a Stackelberg leader-follower game between a leader operating curbside spaces, who sets space allocation and pricing of each curbside usage, and multi-followers, one for each type of curbside usage, who accept the proposed prices or reject them in favor of outside options. The proposed model offers flexible adaptability to manage curb space usages characterized by high turnover rates, such as parking and ride-sourcing pickup and drop-off, alongside accommodating usages that require more permanent infrastructure allocation, such as micromobility stations. Furthermore, the proposed model is able to capture the sensitivity of users to both prices, which are determined solely by the operator, and the occupancy levels of the curb space, which are determined by the complex interactions between the curbside operator and the users. We model a Stackelberg leader-follower game as a bilevel nonlinear optimization problem and reconstruct the problem into a single-level convex program by applying the Karush-Kuhn-Tucker conditions, objective function transformation, and constraint linearization. Then, we develop a solution algorithm that leverages valid inequalities produced via Benders decomposition. We validate the practicability of the model and draw insights into curbside management using numerical experiments. History: This paper has been accepted for the Transportation Sci. Special Issue on the ISTTT25 Conference. Funding: This work was supported by the National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation [Grant 2046372]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0507 .
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (6) , 1252-1276
Dynamic Usage Allocation and Pricing for Curb Space Operation
The importance of curbside management is quickly growing in a modernized urban setting. Dynamic allocation of curb space to different usages and dynamic pricing for those usages can help meet the growing demand for curb space more effectively and promote user turnover. To model curbside operations, we formulate a Stackelberg leader-follower game between a leader operating curbside spaces, who sets space allocation and pricing of each curbside usage, and multi-followers, one for each type of curbside usage, who accept the proposed prices or reject them in favor of outside options. The proposed model offers flexible adaptability to manage curb space usages characterized by high turnover rates, such as parking and ride-sourcing pickup and drop-off, alongside accommodating usages that require more permanent infrastructure allocation, such as micromobility stations. Furthermore, the proposed model is able to capture the sensitivity of users to both prices, which are determined solely by the operator, and the occupancy levels of the curb space, which are determined by the complex interactions between the curbside operator and the users. We model a Stackelberg leader-follower game as a bilevel nonlinear optimization problem and reconstruct the problem into a single-level convex program by applying the Karush-Kuhn-Tucker conditions, objective function transformation, and constraint linearization. Then, we develop a solution algorithm that leverages valid inequalities produced via Benders decomposition. We validate the practicability of the model and draw insights into curbside management using numerical experiments. History: This paper has been accepted for the Transportation Sci. Special Issue on the ISTTT25 Conference. Funding: This work was supported by the National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation [Grant 2046372]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0507 .
- 1 November 2022
- Published by American Society of Civil Engineers (ASCE) in Journal of Transportation Engineering, Part A: Systems
- Vol. 148 (11) , 04022095
The Bicycle Network Improvement Problem
Using a bicycle for commuting is still uncommon in US cities, although it brings many benefits to both the cyclists and to society as a whole. Cycling has the potential to reduce traffic congestion and emissions, increase mobility, and improve public health. To convince people to commute by bike, the infrastructure plays an important role because safety is one of the primary concerns of potential cyclists. This paper presents a method to find the best way to improve the safety of a bicycle network for a given budget and maximize the number of riders that could now choose bicycles for their commuting needs. This optimization problem is formalized as the bicycle network improvement problem (BNIP): it selects which roads to improve for a set of traveler origin–destination pairs, taking both safety and travel distance into account. The BNIP is modeled as a mixed-integer linear program (MIP) that minimizes a piecewise linear penalty function of route deviations of travelers. The MIP is solved using Benders decomposition to scale to large instances. The paper also presents an in-depth case study for the Midtown area in Atlanta, GA, using actual transportation data. The results show that Benders decomposition algorithm allows for solving realistic problem instances and that the network improvements may significantly increase the share of bicycles as the commuting mode. Multiple practical aspects are considered as well, including sequential road improvements, uneven improvement costs, and how to include additional data.
- 1 November 2022
- Published by American Society of Civil Engineers (ASCE) in Journal of Transportation Engineering, Part A: Systems
- Vol. 148 (11) , 04022095
The Bicycle Network Improvement Problem
Using a bicycle for commuting is still uncommon in US cities, although it brings many benefits to both the cyclists and to society as a whole. Cycling has the potential to reduce traffic congestion and emissions, increase mobility, and improve public health. To convince people to commute by bike, the infrastructure plays an important role because safety is one of the primary concerns of potential cyclists. This paper presents a method to find the best way to improve the safety of a bicycle network for a given budget and maximize the number of riders that could now choose bicycles for their commuting needs. This optimization problem is formalized as the bicycle network improvement problem (BNIP): it selects which roads to improve for a set of traveler origin–destination pairs, taking both safety and travel distance into account. The BNIP is modeled as a mixed-integer linear program (MIP) that minimizes a piecewise linear penalty function of route deviations of travelers. The MIP is solved using Benders decomposition to scale to large instances. The paper also presents an in-depth case study for the Midtown area in Atlanta, GA, using actual transportation data. The results show that Benders decomposition algorithm allows for solving realistic problem instances and that the network improvements may significantly increase the share of bicycles as the commuting mode. Multiple practical aspects are considered as well, including sequential road improvements, uneven improvement costs, and how to include additional data.