TRB Pubsindex
Text Size:

Title:

Parallel Ant Colony Algorithm for Train Time-Tabling Problem of Taiwan Metropolitan Rapid Transit

Accession Number:

01128686

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

The purpose of this research is to develop a parallel ant colony algorithm (PACA) to solve the train timetabling problem. This algorithm takes into consideration the trains timetabling in the transit period between peak and off-peak period, the conflict resolving and the balance of fleets for each depot. A case study using the Taipei Metropolitan Rapid Transit (MRT) is giving to demonstrate the algorithm and its potential applications. The result indicates that the algorithm can generate the feasible train timetable and solve the conflicts effectively.

Monograph Accession #:

01120148

Report/Paper Numbers:

09-1148

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Su, Jau-Ming
Huang, Jen-Yu

Pagination:

17p

Publication Date:

2009

Conference:

Transportation Research Board 88th Annual Meeting

Location: Washington DC, United States
Date: 2009-1-11 to 2009-1-15
Sponsors: Transportation Research Board

Media Type:

DVD

Features:

Figures (6) ; References (13) ; Tables (1)

Uncontrolled Terms:

Geographic Terms:

Subject Areas:

Planning and Forecasting; Railroads; I72: Traffic and Transport Planning

Source Data:

Transportation Research Board Annual Meeting 2009 Paper #09-1148

Files:

TRIS, TRB

Created Date:

Jan 30 2009 5:22PM