Cart (Loading....) | Create Account
Close category search window
 

Robust Train Timetabling Problem: Mathematical Model and Branch and Bound Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shafia, M.A. ; Ind. Eng. Dept., Iran Univ. of Sci. & Technol., Tehran, Iran ; Aghaee, M.P. ; Sadjadi, S.J. ; Jamili, A.

This paper illustrates the results of an investigation into developing a new robust train-timetabling problem in a single-track railway line. The proposed model is formulated as a robust form of the mixed integer approach. A branch-and-bound (B&B) algorithm, along with a new heuristic beam search (BS) algorithm, is presented to solve the model for large-scale problems in reasonable time. We also propose two different methods to measure the required buffer times under the assumption of unknown and known distribution functions of disturbances. We have generated some random instances, and the efficiency of the B&B and BS algorithms are demonstrated by comparing the results with common software packages as well as a new lower bound method. The results demonstrate that the B&B algorithm can find optimum solutions in a shorter amount of time compared with common software packages such as Lingo. Moreover, the BS algorithm can effectively find a near-optimum solution in a rational amount of time.

Published in:

Intelligent Transportation Systems, IEEE Transactions on  (Volume:13 ,  Issue: 1 )

Date of Publication:

March 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.