Login | Register

Optimization of Locomotive Management and Fuel Consumption in Rail Freight Transport

Title:

Optimization of Locomotive Management and Fuel Consumption in Rail Freight Transport

Tian, Huaining (2017) Optimization of Locomotive Management and Fuel Consumption in Rail Freight Transport. PhD thesis, Concordia University.

[img]
Text (application/pdf)
Tian_PhD_S2018.pdf - Accepted Version
Restricted to Repository staff only until 24 January 2020.
Available under License Spectrum Terms of Access.
3MB

Abstract

For the enormous capital investment and high operation expense of locomotives, the locomotive management/assignment and fuel consumption are two of the most important areas for railway industry, especially in freight train transportation.
Several algorithms have been developed for the Locomotive Assignment Problem (LAP), including exact mathematics models, approximate dynamic programming and heuristics. These previously published optimization algorithms suffer from scalability or solution accuracy issues. In addition, each of the optimization models lacks part of the constraints that are necessary in real-world train/locomotive operation, e.g., maintenance/shop constraints or consist busting avoidance. Furthermore, there are rarely research works for the reduction of total train energy consumption on the locomotive assignment level.
The thesis is organized around our three main contributions. Firstly we propose a “consist travel plan” based LAP optimization model, which covers all the required meaningful constraints and which can efficiently be solved using large scale optimization techniques, namely column generation (CG) decomposition. Our key contribution is that our LAP model can evaluate the occurrence of consist busting using the number of consist travel plans, and allows locomotive status transformation in flow conservation constraints.
In addition, a new column generation acceleration architecture is developed, that allows the subproblem, i.e., column generator to create multiple columns in each iteration, that each is an optimal solution for a reduced sub-network. This new CG architecture reduces computational time greatly comparing to our original LAP model.
For train fuel consumption, we derive, linearize and integrate a train fuel consumption model into our LAP model. In addition, we establish a conflict-free pre-process for time windows for train rescheduling without touching train-meet time and position. The new LAP-fuel consumption model works fine for the optimization of the train energy exhaustion on the locomotive assignment level.
For the optimization models above, the numerical results are conducted on the railway network infrastructure of Canada Pacific Railway (CPR), with up to 1,750 trains and 9 types of locomotives over a two-week time period in the entire CPR railway network.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (PhD)
Authors:Tian, Huaining
Institution:Concordia University
Degree Name:Ph. D.
Program:Computer Science
Date:December 2017
Thesis Supervisor(s):Jaumard, Brigitte
Keywords:Large scale optimization, Linear programming, OR in service industries, semi-infinite programming, Transportation
ID Code:983628
Deposited By: HUAINING TIAN
Deposited On:06 Jun 2018 15:06
Last Modified:06 Jun 2018 15:06
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top