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

Authors:
A. Jamili;M. A. Shafia;S. J. Sadjadi;R. Tavakkoli-Moghaddam
Affiliations:
Department of Rail Transportation, MAPNA Co., Tehran, Iran and 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
Venue:
Engineering Applications of Artificial Intelligence
Year:
2012

Citing 12
Cited 1

A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
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
An efficient stochastic hybrid heuristic for flowshop scheduling

Engineering Applications of Artificial Intelligence
Distributed search in railway scheduling problems

Engineering Applications of Artificial Intelligence
A hybrid electromagnetism-like algorithm for single machine scheduling problem

Expert Systems with Applications: An International Journal
A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness

Soft Computing - A Fusion of Foundations, Methodologies and Applications
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Computers and Industrial Engineering
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 periodicity and robustness in a single-track train scheduling problem

Applied Soft Computing
Robust Train Timetabling Problem: Mathematical Model and Branch and Bound Algorithm

IEEE Transactions on Intelligent Transportation Systems

Multi objective particle swarm optimization algorithm for the design of efficient ATO speed profiles in metro lines

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Train timetabling with minimum delays is the most important operating problem in any railway industry. This problem is considered to be one of the most interesting research topics in railway optimization problems. This paper deals with scheduling different types of trains in a single railway track. The primary focus of this paper is on the periodic aspects of produced timetables and the proposed modeling is based on the periodic event scheduling problem (PESP). To solve large-scale problems, a hybrid meta-heuristic algorithm based on simulated annealing (SA) and particle swarm optimization (PSO) is proposed and validated using some numerical examples and an Iranian case study that covers the railway line between two cities of Isfahan and Tehran.