Yuyan Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuyan Tan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Zhibin Jiang
Tongji Univ, Coll Transportat Engn, Shanghai 201804, Peoples R China
3 shared publications - Feng Wang
Ingram School of Engineering, Texas State University, San Marcos, TX
1 shared publication Lei Bu
Department of Civil and Environmental Engineering, Jackson State University, P.O. Box 17068, Jackson, MS, USA
1 shared publication- Özgür Yalçinkaya
Dokuz Eylül Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü, Buca, İzmir, TÜRKİYE
1 shared publication
Latest Publications
- Open Access
- 22 March 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-12
A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany
With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains. In this work, the problem is characterized as a job-shop scheduling problem. In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution. With these issues in mind, the problem of adding train paths is decomposed into two subproblems. One is finding the optimal insertion for a fixed order timetable and the other is reordering trains. The two subproblems are solved iteratively until no improvement is possible within a time limit of computation. An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time. Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable. From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.
- 22 March 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-12
Open AccessA Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany
With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains. In this work, the problem is characterized as a job-shop scheduling problem. In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution. With these issues in mind, the problem of adding train paths is decomposed into two subproblems. One is finding the optimal insertion for a fixed order timetable and the other is reordering trains. The two subproblems are solved iteratively until no improvement is possible within a time limit of computation. An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time. Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable. From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.
- Open Access
- 1 January 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-12
Turnback Capacity Assessment and Delay Management at a Rail Transit Terminal with Two-Tail Tracks
Terminal capacity and performance have become a major concern for rail transit agencies in China due to the ever increasing passenger demand. This paper develops a mixed integer programming (MIP) optimization model to estimate the turnback capacity and performance of a rail transit terminal with two-tail tracks. The capacity evaluation and delay propagation are described and assessed as an-track integrated model with minimal time span and train delay. Operations and design parameters such as tail track allocation strategies, maximum layover time, headway pattern, buffer time distribution scheme, and primary delay are also considered in this model. The effectiveness of the model is tested by a case study with computation results drawn from one terminal station in Shanghai, China. The case study results show that unfixed platform time and flexible tail track allocation strategies can improve the capacity of turnback operation, and the strategy of allowing swapping of the tail tracks has a significantly positive impact on delay absorption.- 1 January 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-12
Open AccessTurnback Capacity Assessment and Delay Management at a Rail Transit Terminal with Two-Tail Tracks
Terminal capacity and performance have become a major concern for rail transit agencies in China due to the ever increasing passenger demand. This paper develops a mixed integer programming (MIP) optimization model to estimate the turnback capacity and performance of a rail transit terminal with two-tail tracks. The capacity evaluation and delay propagation are described and assessed as an-track integrated model with minimal time span and train delay. Operations and design parameters such as tail track allocation strategies, maximum layover time, headway pattern, buffer time distribution scheme, and primary delay are also considered in this model. The effectiveness of the model is tested by a case study with computation results drawn from one terminal station in Shanghai, China. The case study results show that unfixed platform time and flexible tail track allocation strategies can improve the capacity of turnback operation, and the strategy of allowing swapping of the tail tracks has a significantly positive impact on delay absorption. - Open Access
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Scheduling Additional Train Unit Services on Rail Transit Lines
This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. We illustrated our model using computational experiments drawn from the real rail transit line 16 in Shanghai and reached results which show that rail transit agencies can obtain a reasonable new timetable for different managerial goals in a matter of seconds, so the model is well suited to be used in daily operations.
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Open AccessScheduling Additional Train Unit Services on Rail Transit Lines
This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. We illustrated our model using computational experiments drawn from the real rail transit line 16 in Shanghai and reached results which show that rail transit agencies can obtain a reasonable new timetable for different managerial goals in a matter of seconds, so the model is well suited to be used in daily operations.