A Multi-Objective Model about Period Train Timetable Problem and a Genetic Algorithm Based on Job-Shop Problem

Article Preview

Abstract:

At present, periodic train timetable problem (PTTP) becomes one of the hot topics home and abroad. On the basic of present theories and methods about periodic and non-periodic train timetable problem, the thesis constructs a multi-objectives model for the PTTP, transfers it into a single model with multi-priorities structure, and designs a genetic algorithm in a given period by the basic ideas on solving job shop problem. Finally, the paper gives out a instance for Jingjin railroad to show effectiveness of the algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

56-59

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] P. Serafini and W. Ukovich, in: A mathematical model for periodic scheduling problems[J]. SIAM Journal Discrete Mathematics, 1989, (2): 550-581.

DOI: 10.1137/0402049

Google Scholar

[2] M. Odijk. In: A constraint generation algorithm for the construction of periodic railway timetables[J]. Transportation Research Part B, 1996, (6): 455-464.

DOI: 10.1016/0191-2615(96)00005-7

Google Scholar

[3] K. Nachtigall and S. Voget, in: A genetic algorithm approach to periodic railway synchronization[J]. Computers and Operations Research, 1996, (5): 453-463.

DOI: 10.1016/0305-0548(95)00032-1

Google Scholar

[4] P. Tormos, A. Lova, F. Barber,L. Ingolotti, M. Abril, and M.A. Salido, In: A Genetic Algorithm for Railway Scheduling Problems[J]. Computational Intelligence(SCI), 2008, (128): 255-276.

DOI: 10.1007/978-3-540-78985-7_10

Google Scholar