Modeling and solving the train pathing problem

Yusin Lee; Chuen Yih Chen

Modeling and solving the train pathing problem

Yusin Lee, Chuen Yih Chen

Department of Civil Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.

Original language	English
Title of host publication	WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.
Pages	242-247
Number of pages	6
Publication status	Published - 2008 Dec 1
Event	12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Orlando, FL, United States Duration: 2008 Jun 29 → 2008 Jul 2

Publication series

Name	WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.
Volume	5

Other

Other	12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008
Country	United States
City	Orlando, FL
Period	08-06-29 → 08-07-02

All Science Journal Classification (ASJC) codes

Artificial Intelligence
Computer Networks and Communications

Access to Document

Fingerprint Dive into the research topics of 'Modeling and solving the train pathing problem'. Together they form a unique fingerprint.

Cite this

Lee, Y., & Chen, C. Y. (2008). Modeling and solving the train pathing problem. In WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc. (pp. 242-247). (WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.; Vol. 5).

Lee, Yusin ; Chen, Chuen Yih. / Modeling and solving the train pathing problem. WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.. 2008. pp. 242-247 (WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.).

@inproceedings{41bf636b30974a6eab3e42821619e0d3,

title = "Modeling and solving the train pathing problem",

abstract = "In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.",

author = "Yusin Lee and Chen, {Chuen Yih}",

year = "2008",

month = dec,

day = "1",

language = "English",

isbn = "1934272353",

series = "WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.",

pages = "242--247",

booktitle = "WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.",

note = "12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 ; Conference date: 29-06-2008 Through 02-07-2008",

}

Lee, Y & Chen, CY 2008, Modeling and solving the train pathing problem. in WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.. WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc., vol. 5, pp. 242-247, 12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008, Orlando, FL, United States, 08-06-29.

Modeling and solving the train pathing problem. / Lee, Yusin; Chen, Chuen Yih.

WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.. 2008. p. 242-247 (WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.; Vol. 5).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Modeling and solving the train pathing problem

AU - Lee, Yusin

AU - Chen, Chuen Yih

PY - 2008/12/1

Y1 - 2008/12/1

N2 - In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.

AB - In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.

UR - http://www.scopus.com/inward/record.url?scp=84869390340&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869390340&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84869390340

SN - 1934272353

SN - 9781934272350

T3 - WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.

SP - 242

EP - 247

BT - WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.

T2 - 12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008

Y2 - 29 June 2008 through 2 July 2008

ER -

Lee Y, Chen CY. Modeling and solving the train pathing problem. In WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.. 2008. p. 242-247. (WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.).