Title:
Models and algorithms for dynamic real-time freight train re-routing
Models and algorithms for dynamic real-time freight train re-routing
| dc.contributor.advisor | Erera, Alan L. | |
| dc.contributor.author | Parcham-Kashani, Alborz | |
| dc.contributor.committeeMember | Sokol, Joel | |
| dc.contributor.committeeMember | Vande Vate, John | |
| dc.contributor.committeeMember | Goldsman, David | |
| dc.contributor.committeeMember | Ramcharan, David | |
| dc.contributor.department | Industrial and Systems Engineering | |
| dc.date.accessioned | 2019-01-16T17:24:05Z | |
| dc.date.available | 2019-01-16T17:24:05Z | |
| dc.date.created | 2018-12 | |
| dc.date.issued | 2018-11-09 | |
| dc.date.submitted | December 2018 | |
| dc.date.updated | 2019-01-16T17:24:05Z | |
| dc.description.abstract | This dissertation focuses on solving a train re-routing problem in a near real-time context for a freight train carrier operating over a large network. A holistic evaluation framework is developed using a time-space network model. Computational results using data from a class I railroad in the United States are used to determine the subset of problem instances that can be solved using the evaluation framework by systematically evaluating all solutions. Solving the remaining problem instances is addressed by developing two solution methodologies that leverage the evaluation framework: an optimization-based approach and a search-based heuristic approach. A further problem variant is also introduced where rail terminal processing rate is a non-constant function of the traffic at the rail terminal. The above approaches are extended to address the problem variant. Computational results are presented for a comprehensive set of problem instances created using data from a class I railroad in the United States. Results indicate the tractability of the optimization-based approach for large-scale instances, practical solution time with reasonable compute resources, as well as the robustness of solution quality to increases in the number of candidate trains. The solution time of the search-based heuristic approach is furthermore shown to be robust to increases in network traffic volume. The results are discussed in detail, along with implications for future research. | |
| dc.description.degree | Ph.D. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/60774 | |
| dc.publisher | Georgia Institute of Technology | |
| dc.subject | Supply chain | |
| dc.subject | Routing | |
| dc.subject | Re-routing | |
| dc.subject | Transportation | |
| dc.subject | Optimization | |
| dc.subject | Heuristic search methods | |
| dc.title | Models and algorithms for dynamic real-time freight train re-routing | |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Erera, Alan L. | |
| local.contributor.corporatename | H. Milton Stewart School of Industrial and Systems Engineering | |
| local.contributor.corporatename | College of Engineering | |
| relation.isAdvisorOfPublication | 9c57adb1-12eb-40c7-bc1a-b77b6871cc03 | |
| relation.isOrgUnitOfPublication | 29ad75f0-242d-49a7-9b3d-0ac88893323c | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 | |
| thesis.degree.level | Doctoral |