The periodicity and robustness in a single-track train scheduling problem

Authors:
Mohammad Ali Shafia;Seyed Jafar Sadjadi;Amin Jamili;Reza Tavakkoli-Moghaddam;Mohsen Pourseyed-Aghaee
Affiliations:
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;Department of Railway Engineering, Iran University of Science and Technology, Tehran, Iran
Venue:
Applied Soft Computing
Year:
2012

Citing 14
Cited 1

A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
Fuzzy set theory—and its applications (3rd ed.)

Fuzzy set theory—and its applications (3rd ed.)
Simultaneous disruption recovery of a train timetable and crew roster in real time

Computers and Operations Research
Generation of classes of robust periodic railway timetables

Computers and Operations Research
Real-time task scheduling with fuzzy uncertainty in processing times and deadlines

Applied Soft Computing
Real-time scheduling of periodic tasks with processing times and deadlines as parametric fuzzy numbers

Applied Soft Computing
Fast Approaches to Improve the Robustness of a Railway Timetable

Transportation Science
A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows

Applied Soft Computing
A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Applied Soft Computing
A Lagrangian heuristic algorithm for a real-world train timetabling problem

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem

Applied Soft Computing
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Applied Soft Computing
Stochastic optimization model and solution algorithm for robust double-track train-timetabling problem

IEEE Transactions on Intelligent Transportation Systems
Robust Train Timetabling Problem: Mathematical Model and Branch and Bound Algorithm

IEEE Transactions on Intelligent Transportation Systems

Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most important operating problem in any railway industry is to produce robust train timetables with minimum delays. The train scheduling problem is defined as an application of job shop scheduling which is considered to be one of the most interesting research topics. This paper deals with scheduling different types of trains in a single railway track. The authors have focused on the robust and periodic aspects of produced timetables. This paper is also concerned with some applicable constraints, such as the acceleration and deceleration times, station capacity and headway constraints. The periodic timetable for railways is modeled based on the periodic event scheduling problem (PESP). Furthermore, a fuzzy approach is used to reach a tradeoff among the total train delays, the robustness of schedules, and the time interval between departures of trains from the same origins. To solve large-scale problems, a meta-heuristic algorithm based on simulated annealing (SA) is utilized and validated using some numerical examples on a periodic robust train scheduling problem. Finally, a robustness measure is defined in order to assure the effectiveness of the proposed SA to find robust solutions.