Page 1 |
Save page Remove page | Previous | 1 of 175 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
MINIMIZING CONGESTION ON RAILWAY NETWORKS
by
Shi Mu
__________________________________________________________________
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(INDUSTRIAL AND SYSTEMS ENGINEERING)
August 2011
Copyright 2011 Shi Mu
Object Description
| Title | Minimizing congestion on railway networks |
| Author | Mu, Shi |
| Author email | smu@usc.edu;cdshimu@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Industrial and Systems Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2011-06-20 |
| Date submitted | 2011-07-18 |
| Date approved | 2011-07-18 |
| Restricted until | 2011-07-18 |
| Date published | 2011-07-18 |
| Advisor (committee chair) | Dessouky, Maged M. |
| Advisor (committee member) |
Ordonez, Fernando I. Giuliano, Genevieve |
| Abstract | The railway transportation is becoming more and more important to the whole transportation system. The railway transportation is cost-effective, energy-efficient and safe. The railway is a major method of transportation of freight and passengers in many countries. Given the fact that the railway industry is facing rapid increasing demand, better planning and scheduling tools are needed to effectively manage the scarce resources. In this thesis, we focus on developing train scheduling and train dispatching algorithms that minimize the congestions on railway networks. ❧ The first part of this thesis studies the freight train scheduling problem. We develop optimization-based approaches for scheduling of freight trains. Two mathematical formulations of the scheduling problem are first introduced. Two heuristics based on mixtures of the two formulations are proposed. The proposed algorithms are able to perform better than two existing heuristics such as a simple look-ahead greedy heuristic and global neighborhood search algorithms, in terms of total train delay. For relatively large networks, two algorithms based on the idea of decomposition are proposed. We use two sample networks to test our proposed decomposition algorithms. The two sample networks are 33.9-mile and 49.3-mile long, respectively. Our decomposition algorithms are shown to outperform the two existing algorithms. ❧ The second part of the thesis studies the train dispatching problem for double-track and triple-track railway segment. The regular dedicated dispatching policy dedicates one track for trains travelling in one direction. If trains are travelling at different speeds, the faster train will catch up with the slower train thus be delayed. We first look at the problem where there are only two train speeds in the network, we propose a switchable dispatching policy for the double-track segment to reduce the chance that a faster train being blocked by a slower train. We use queueing theories to derive the delay functions. The new switchable dispatching policy is shown to significantly reduce the train delays compared to a dedicated policy. We also study the effect of having a crossover at the middle of the track segment. The switchable policy is then extended to the triple-track segment. Several variations of the switchable policy for triple-track segment are studied. Finally, we study the double-track segment dispatching policy for multiple train speeds. |
| Keyword | train; optimization; scheduling; heuristics |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Contributing entity | University of Southern California |
| Rights | Mu, Shi |
| Physical access | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@lib.usc.edu |
| Archival file | uscthesesreloadpub_Volume71/etd-MuShi-111.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | MINIMIZING CONGESTION ON RAILWAY NETWORKS by Shi Mu __________________________________________________________________ A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (INDUSTRIAL AND SYSTEMS ENGINEERING) August 2011 Copyright 2011 Shi Mu |
