Julia Yan

Julia Yan

Auto-generated profile, based on publicly available information

Julia Yan

Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z4, Canada

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 July 2021 in Operations Research
Verified
Journal Article
Closed access
DBDimitris Bertsimas
Dimitris Bertsimas
YNYee Sian Ng
Yee Sian Ng
JYJulia Yan
Julia Yan
Mass transit remains the most efficient way to service a densely packed commuter population. However, reliability issues and increasing competition in the transportation space have led to declining ridership across the United States, and transit agencies must also operate under tight budget constraints. Recent attempts at using bus network redesign to improve ridership have attracted attention from various transit authorities. However, the analysis seems to rely on ad hoc methods, for example, considering each line in isolation and using manual incremental adjustments with backtracking. We provide a holistic approach to designing a transit network using column generation. Our approach scales to hundreds of stops, and we demonstrate its usefulness on a case study with real data from Boston.

1 March 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
CBCynthia Barnhart
Cynthia Barnhart
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
JYJulia Yan
Julia Yan
Problem definition: Physical distancing requirements during the COVID-19 pandemic have dramatically reduced the effective capacity of university campuses. Under these conditions, we examine how to make the most of newly scarce resources in the related problems of curriculum planning and course timetabling. Academic/practical relevance: We propose a unified model for university course scheduling problems under a two-stage framework and draw parallels between component problems while showing how to accommodate individual specifics. During the pandemic, our models were critical to measuring the impact of several innovative proposals, including expanding the academic calendar, teaching across multiple rooms, and rotating student attendance through the week and school year. Methodology: We use integer optimization combined with enrollment data from thousands of past students. Our models scale to thousands of individual students enrolled in hundreds of courses. Results: We projected that if Massachusetts Institute of Technology moved from its usual two-semester calendar to a three-semester calendar, with each student attending two semesters in person, more than 90% of student course demand could be satisfied on campus without increasing faculty workloads. For the Sloan School of Management, we produced a new schedule that was implemented in fall 2020. The schedule allowed half of Sloan courses to include an in-person component while adhering to safety guidelines. Despite a fourfold reduction in classroom capacity, it afforded two thirds of Sloan students the opportunity for in-person learning in at least half their courses. Managerial implications: Integer optimization can enable decision making at a large scale in a domain that is usually managed manually by university administrators. Our models, although inspired by the pandemic, are generic and could apply to any scheduling problem under severe capacity constraints.

1 August 2018 in Transportation Science
Verified
Journal Article
Closed access
DBDimitris Bertsimas
Dimitris Bertsimas
JYJulia Yan
Julia Yan
Efficient management of transportation systems requires accurate trip demand data. It is sometimes possible to track anonymized users through their commutes, accomplished through previous studies on smart cards, license plates, and mobile phones. However, frequently the main public transit data sources are in aggregated forms such as entry and exit counts, and one must recover the original demand from these aggregated counts. Such problems are generally underspecified. To address this, we present an optimization framework to recover origin–destination matrices under minimal assumptions, incorporating reasonable physical constraints such as flow conservation, smoothness, and symmetry. The proposed method is evaluated and shows strong (∼5%–10%) improvement in R2 over the maximum entropy method on a variety of real-world data sets from Boston, New York City, and San Francisco, comprising tens to hundreds of stations.

1 July 2025 in Management Science
Verified
Journal Article
Closed access
JYJulia Yan
Julia Yan
SMSébastien Martin
Sébastien Martin
STSean J. Taylor
Sean J. Taylor
On-demand ride-sharing aims to fulfill riders’ transportation needs whenever and wherever they want. Although this service level appeals to riders, overall system efficiency can improve substantially if riders are willing to be flexible. Here, we explore riders’ flexibility in space via walking to more accessible pickup locations. Ride-sharing platforms have traditionally implemented dynamic walking to optimize rider pickup locations and rider-driver assignment jointly. We propose an alternative that we call static walking, which presents a predetermined pickup location to the rider before optimizing rider-driver assignment. Although dynamic walking enables more efficient matching of riders and drivers, we hypothesize that riders prefer static walking because of the certainty of the pickup location before booking the ride. Using simulations on Lyft data, we show that static walking can capture up to 96% of the value of dynamic walking in congested urban networks at a fixed adoption rate. Furthermore, experimentation on Lyft’s user interface suggests that providing riders with information on pickup location before an opt-in decision can increase walking adoption—to the extent that static walking may outperform dynamic walking overall. More broadly, this study highlights the importance of carefully designing flexibility mechanisms on platforms: a little flexibility goes a long way, especially when flexibility presents a barrier to adoption. This paper was accepted by J. George Shanthikumar, data science. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2022.03201 .

10 June 2014 in Physical Review A
Verified
Journal Article
Closed access
JYJulia Yan
Julia Yan
DHDavid Hocker
David Hocker
RLRuixing Long
Ruixing Long
THTak-San Ho
Tak-San Ho
HRHershel Rabitz
Hershel Rabitz
Manipulation of a quantum system can be viewed in the framework of a control landscape defined as the physical objective as a functional of the control. Control landscape analyses have thus far considered linear quantum dynamics. This paper extends the analysis of control landscape topology to nonlinear quantum dynamics with the objective of steering a finite-level quantum system from an initial state to a final target state. The analysis rests on the assumptions that (i) the final state is reachable from the initial state, (ii) the differential mapping from the control to the state is surjective, and (iii) the control resources are unconstrained. Under these assumptions, landscape critical points (i.e., where the slope vanishes) for nonlinear quantum dynamics only appear as the global maximum and minimum; thus, the landscape is free of traps. Moreover, the landscape Hessian (i.e., the second derivative with respect to the control) at the global maximum has finite rank, indicating the presence of a large level set of optimal controls that preserve the value of the maximum. Extensive numerical simulations on finite-level models of the Gross-Pitaevskii equation confirm the trap-free nature of the landscape as well as the Hessian rank analysis, using either an applied electric field or a tunable condensate two-body interaction strength as the control. In addition, the control mechanisms arising in the numerical simulations are qualitatively assessed. These results are a generalization of previous findings for the linear Schr\"odinger equation, and show promise for successful control in a wide range of nonlinear quantum dynamics applications.

16 March 2026 in Operations Research
Verified
Journal Article
Closed access
CYChiwei Yan
Chiwei Yan
JYJulia Yan
Julia Yan
YSYifan Shen
Yifan Shen
Pricing Based on Matching Outcomes Improves Shared Rides Operations Shared rides aspire to mitigate congestion and promote more sustainable urban transportation, but many platforms struggle to maintain a healthy and profitable shared rides product. Why have shared rides struggled, and how can platforms design a successful product? In “Pricing Shared Rides,” Chiwei Yan, Julia Yan, and Yifan Shen discuss the drawbacks of platforms’ existing pricing policies and show that a common approach to pricing suppresses demand and may even drive the platform out of the market. They then propose adjusting the price according to the extent she is matched with another rider—which proves to benefit both platform and riders alike in increased profitability and reduced payments. These benefits are especially pronounced in regimes with high cost and low demand, expanding shared rides access to areas where they have historically been most challenging to sustain.