Last-Train Timetabling under Transfer Demand Uncertainty: Mean-Variance Model and Heuristic Solution

31Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Traditional models of timetable generation for last trains do not account for the fact that decision-maker (DM) often incorporates transfer demand variability within his/her decision-making process. This study aims to develop such a model with particular consideration of the decision-makers' risk preferences in subway systems under uncertainty. First, we formulate an optimization model for last-train timetabling based on mean-variance (MV) theory that explicitly considers two significant factors including the number of successful transfer passengers and the running time of last trains. Then, we add the mean-variance risk measure into the model to generate timetables by adjusting the last trains' departure times and running times for each line. Furthermore, we normalize two heterogeneous terms of the risk measure to provide assistance in getting reasonable results. Due to the complexity of MV model, we design a tabu search (TS) algorithm with specifically designed operators to solve the proposed timetabling problem. Through computational experiments involving the Beijing subway system, we demonstrate the computational efficiency of the proposed MV model and the heuristic approach.

Cite

CITATION STYLE

APA

Yang, S., Yang, K., Gao, Z., Yang, L., & Shi, J. (2017). Last-Train Timetabling under Transfer Demand Uncertainty: Mean-Variance Model and Heuristic Solution. Journal of Advanced Transportation, 2017. https://doi.org/10.1155/2017/5095021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free