Yuan Gao
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
Yuan Gao has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
Lixing Yang
13 shared publicationsZiyou Gao
9 shared publicationsChuntian Zhang
5 shared publications- Lixing Yang
School of Systems Science, Beijing Jiaotong University, Beijing, China
3 shared publications Shukai Li
3 shared publicationsHaifeng Zhang
2 shared publications
Latest Publications
- 4 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (5) , 742-764
Short-Term Rolling Stock Scheduling and Platform Assignment: A Branch-and-Check Method
Railway passenger demand fluctuates because of events, holidays, and individual traveler activities, making it difficult to predict several months in advance. Market-oriented railway plans feature strategies for canceling or adding train trips according to short-term forecasted passenger demand. This results in dynamic adjustments of the rolling stock schedule (RSS) and the train platforming plan (TPP) on a daily basis. The RSS defines the schedule of the train units (TUs), that is, the sequence of trips that each TU will execute and the maintenance appointments it has to undergo. The TPP defines the assignment of platforms to TUs: when two trips are executed in sequence by the same TU, a platform has to be assigned to the TU for the trip connection. Because of demand fluctuation, the RSS has to be adjusted to perform a set of trips different from those in the original plan, requiring new trip sequences and rescheduled maintenance appointments for the TUs, whereas the TPP has to be modified to guarantee the feasible assignment of the platforms to the TUs performing the newly defined trip sequences. To assist railway departments in making optimized decisions, this work studies the integrated adjustment of the RSS and TPP by proposing an integer linear programming model and an exact decomposition algorithm. The integrated model consists of two parts: (i) rolling stock scheduling with maintenance constraints, and (ii) platform assignment. The goal is to minimize the operating costs and the deviations from the original plan. The decomposition algorithm consists of a branch-and-check (B&C) method in which maintenance constraints and platform assignment are handled by dynamic cut generation, and problem-specific acceleration techniques are incorporated to reduce the search space and the computation times. The proposed B&C method is tested on real-world instances from the Chinese high-speed railway system, involving up to 981 trips, showing that optimal solutions are obtained within one hour of computation time. It is shown that the B&C method clearly outperforms solving the integrated model by a general-purpose solver even on medium-size instances. Furthermore, comparisons with different sequential methods, which firstly adjust the RSS and then compute a new TPP, highlight the benefits of the integrated framework. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72171023, U2568220, 72471028], the National Social Science Fund of China [Grant 25&ZD194], the PRIN2022 “Large-scale Optimization for Sustainable and Resilient Energy Systems” [Grant 2022BMBW2A], and the Air Force Office of Scientific Research [Grant FA8655-25-1-7013]. Supplemental Material: The online supplements are available at https://doi.org/10.1287/trsc.2025.0291 .
- 4 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (5) , 742-764
Short-Term Rolling Stock Scheduling and Platform Assignment: A Branch-and-Check Method
Railway passenger demand fluctuates because of events, holidays, and individual traveler activities, making it difficult to predict several months in advance. Market-oriented railway plans feature strategies for canceling or adding train trips according to short-term forecasted passenger demand. This results in dynamic adjustments of the rolling stock schedule (RSS) and the train platforming plan (TPP) on a daily basis. The RSS defines the schedule of the train units (TUs), that is, the sequence of trips that each TU will execute and the maintenance appointments it has to undergo. The TPP defines the assignment of platforms to TUs: when two trips are executed in sequence by the same TU, a platform has to be assigned to the TU for the trip connection. Because of demand fluctuation, the RSS has to be adjusted to perform a set of trips different from those in the original plan, requiring new trip sequences and rescheduled maintenance appointments for the TUs, whereas the TPP has to be modified to guarantee the feasible assignment of the platforms to the TUs performing the newly defined trip sequences. To assist railway departments in making optimized decisions, this work studies the integrated adjustment of the RSS and TPP by proposing an integer linear programming model and an exact decomposition algorithm. The integrated model consists of two parts: (i) rolling stock scheduling with maintenance constraints, and (ii) platform assignment. The goal is to minimize the operating costs and the deviations from the original plan. The decomposition algorithm consists of a branch-and-check (B&C) method in which maintenance constraints and platform assignment are handled by dynamic cut generation, and problem-specific acceleration techniques are incorporated to reduce the search space and the computation times. The proposed B&C method is tested on real-world instances from the Chinese high-speed railway system, involving up to 981 trips, showing that optimal solutions are obtained within one hour of computation time. It is shown that the B&C method clearly outperforms solving the integrated model by a general-purpose solver even on medium-size instances. Furthermore, comparisons with different sequential methods, which firstly adjust the RSS and then compute a new TPP, highlight the benefits of the integrated framework. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72171023, U2568220, 72471028], the National Social Science Fund of China [Grant 25&ZD194], the PRIN2022 “Large-scale Optimization for Sustainable and Resilient Energy Systems” [Grant 2022BMBW2A], and the Air Force Office of Scientific Research [Grant FA8655-25-1-7013]. Supplemental Material: The online supplements are available at https://doi.org/10.1287/trsc.2025.0291 .
- 16 May 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 194
Double-layer Benders decomposition for large-scale robust uncapacitated hub location
- 16 May 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 194
Double-layer Benders decomposition for large-scale robust uncapacitated hub location
- 24 December 2025
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 73 (5) , 784-809
Two‐Stage Adaptive Robust Hub Location Problem Under Demand Uncertainty
This paper studies a two‐stage adaptive robust hub location problem with multiple assignments under demand uncertainty. In our setting, the capacitated hubs are strategically located in the first stage to minimize the worst‐case scenario cost over a budgeted uncertainty set, and the routing decisions, which are adaptive to uncertainty realizations, are made in the second stage to transport all commodities. For the large‐scale instances of the problem, we develop a novel column‐and‐constraint generation approach that integrates Benders decomposition. In this approach, we design a customized Benders decomposition to efficiently solve the master problem involving a subset of uncertain scenarios, in which a tailored cutting plane algorithm is developed to solve Benders dual subproblems and a cut refinement strategy is proposed to generate strong Benders cuts. Besides, to quickly identify possible uncertain scenarios, we reformulate the second‐stage problem into a more tractable form, which is further simplified by significantly reducing the number of redundant variables and constraints. Extensive computational experiments on the well‐known instances with up to 200 nodes are conducted to evaluate the effectiveness of proposed model and the performance of the solution method. The computational results demonstrate that our developed solution method outperforms the conventional column‐and‐constraint generation or Benders decomposition. Compared with the two‐stage stochastic programming model, our proposed model can provide more reliable and robust solutions with superior out‐of‐sample performance. The results also illustrate the effect of uncertainty budgets and highlight the advantages of incorporating features such as hub capacity and multiple assignments into our model. Moreover, we make extensions by applying our framework to handle more general polyhedral uncertainty sets.
- 24 December 2025
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 73 (5) , 784-809
Two‐Stage Adaptive Robust Hub Location Problem Under Demand Uncertainty
This paper studies a two‐stage adaptive robust hub location problem with multiple assignments under demand uncertainty. In our setting, the capacitated hubs are strategically located in the first stage to minimize the worst‐case scenario cost over a budgeted uncertainty set, and the routing decisions, which are adaptive to uncertainty realizations, are made in the second stage to transport all commodities. For the large‐scale instances of the problem, we develop a novel column‐and‐constraint generation approach that integrates Benders decomposition. In this approach, we design a customized Benders decomposition to efficiently solve the master problem involving a subset of uncertain scenarios, in which a tailored cutting plane algorithm is developed to solve Benders dual subproblems and a cut refinement strategy is proposed to generate strong Benders cuts. Besides, to quickly identify possible uncertain scenarios, we reformulate the second‐stage problem into a more tractable form, which is further simplified by significantly reducing the number of redundant variables and constraints. Extensive computational experiments on the well‐known instances with up to 200 nodes are conducted to evaluate the effectiveness of proposed model and the performance of the solution method. The computational results demonstrate that our developed solution method outperforms the conventional column‐and‐constraint generation or Benders decomposition. Compared with the two‐stage stochastic programming model, our proposed model can provide more reliable and robust solutions with superior out‐of‐sample performance. The results also illustrate the effect of uncertainty budgets and highlight the advantages of incorporating features such as hub capacity and multiple assignments into our model. Moreover, we make extensions by applying our framework to handle more general polyhedral uncertainty sets.
- Open Access
- 31 July 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Systems Safety and Reliability
- Vol. 1 (1) , 43-62
State-of-the-Art Advances and Emerging Challenges in UAV Routing Optimization: A Comprehensive Review
This literature review offers an in-depth overview of recent advances in routing optimization for Unmanned Aerial Vehicles (UAVs), a field central to improving the performance, reliability, and flexibility of UAV systems. The review is organized into five categories: (1) multi-objective mission planning, (2) algorithmic design and optimization techniques, (3) energy efficiency and resource allocation, (4) communication protocols and network management, and (5) context-specific applications and environmental adaptability. The review highlights methodological progress and algorithmic approaches developed to balance competing demands such as mission effectiveness, energy use, and communication stability. Emphasis is placed on techniques that aim to extend UAV network longevity through effective energy strategies and on the creation of robust communication frameworks to support dependable data exchange. The study also considers how routing methods are being adapted to accommodate dynamic operational environments and varying external conditions. By drawing together insights from these areas, the review provides a comprehensive perspective on the current state of UAV routing optimization and identifies pressing challenges and directions for future research, with a focus on developing more adaptive and intelligent routing solutions.
- 31 July 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Systems Safety and Reliability
- Vol. 1 (1) , 43-62
Open AccessState-of-the-Art Advances and Emerging Challenges in UAV Routing Optimization: A Comprehensive Review
This literature review offers an in-depth overview of recent advances in routing optimization for Unmanned Aerial Vehicles (UAVs), a field central to improving the performance, reliability, and flexibility of UAV systems. The review is organized into five categories: (1) multi-objective mission planning, (2) algorithmic design and optimization techniques, (3) energy efficiency and resource allocation, (4) communication protocols and network management, and (5) context-specific applications and environmental adaptability. The review highlights methodological progress and algorithmic approaches developed to balance competing demands such as mission effectiveness, energy use, and communication stability. Emphasis is placed on techniques that aim to extend UAV network longevity through effective energy strategies and on the creation of robust communication frameworks to support dependable data exchange. The study also considers how routing methods are being adapted to accommodate dynamic operational environments and varying external conditions. By drawing together insights from these areas, the review provides a comprehensive perspective on the current state of UAV routing optimization and identifies pressing challenges and directions for future research, with a focus on developing more adaptive and intelligent routing solutions.
- 12 February 2025
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 72 (6) , 773-792
Leveraging E‐Waste Recycling via Auctions With Dual Responsibilities
The efficient recycling of electric and electronic waste products (e‐waste) not only provides environmental and societal benefits but also is recognized as being profitable from economic and business perspectives. However, how to design incentive mechanisms for efficient e‐waste recycling with dual responsibilities, namely, corporate social responsibility (CSR) and government rural vitalization, remains unclear. In this paper, we consider an e‐waste recycling problem in which a company collects a certain amount of e‐waste from developed and poor regions. With the goal of CSR, the company reserves a portion of demands for the poor region while realizing as much social welfare as possible. In pursuit of the rural revitalization strategy, the government offers subsidies to agents from the poor region. We introduce the concept of the price of CSR , which is defined as the loss of social welfare. We find the price of CSR is nondecreasing when the demand in the poor region increases. We propose a family of novel Vickrey‐Clarke‐Groves (VCG) auctions with CSR and government subsidies, which are all incentive‐compatible (IC) and individual‐rational (IR). Two strategies are considered for allocating government subsidies, namely, agent subsidy policy and company subsidy policy. Interestingly, if the bid‐ask spread is large enough in the developed region, then the company with CSR obtains higher profits. The outcome of e‐waste recycling is used as a signal for the precise allocation of the budget for government subsidies. The agent subsidy policy can ensure that a “poorer” agent or village receives a higher subsidy. When the company exhibits a low level of CSR, the company subsidy policy can bring more benefits for agents in the poor region at a relatively lower overall subsidy than the agent subsidy policy. This paper enriches the existing auction theory and provides insights into the impacts of firm‐level action (CSR), government policy (subsidies), and individual behavior on rural vitalization.
- 12 February 2025
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 72 (6) , 773-792
Leveraging E‐Waste Recycling via Auctions With Dual Responsibilities
The efficient recycling of electric and electronic waste products (e‐waste) not only provides environmental and societal benefits but also is recognized as being profitable from economic and business perspectives. However, how to design incentive mechanisms for efficient e‐waste recycling with dual responsibilities, namely, corporate social responsibility (CSR) and government rural vitalization, remains unclear. In this paper, we consider an e‐waste recycling problem in which a company collects a certain amount of e‐waste from developed and poor regions. With the goal of CSR, the company reserves a portion of demands for the poor region while realizing as much social welfare as possible. In pursuit of the rural revitalization strategy, the government offers subsidies to agents from the poor region. We introduce the concept of the price of CSR , which is defined as the loss of social welfare. We find the price of CSR is nondecreasing when the demand in the poor region increases. We propose a family of novel Vickrey‐Clarke‐Groves (VCG) auctions with CSR and government subsidies, which are all incentive‐compatible (IC) and individual‐rational (IR). Two strategies are considered for allocating government subsidies, namely, agent subsidy policy and company subsidy policy. Interestingly, if the bid‐ask spread is large enough in the developed region, then the company with CSR obtains higher profits. The outcome of e‐waste recycling is used as a signal for the precise allocation of the budget for government subsidies. The agent subsidy policy can ensure that a “poorer” agent or village receives a higher subsidy. When the company exhibits a low level of CSR, the company subsidy policy can bring more benefits for agents in the poor region at a relatively lower overall subsidy than the agent subsidy policy. This paper enriches the existing auction theory and provides insights into the impacts of firm‐level action (CSR), government policy (subsidies), and individual behavior on rural vitalization.
- 24 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (2) , 494-512
Timetable synchronization of the last several trains at night in an urban rail transit network
- 24 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (2) , 494-512
Timetable synchronization of the last several trains at night in an urban rail transit network