Loading...

Modeling formulation and a new heuristic for the railroad blocking problem

Hasany, R. M ; Sharif University of Technology | 2018

523 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.apm.2017.11.006
  3. Publisher: Elsevier Inc , 2018
  4. Abstract:
  5. The railroad blocking problem is an important issue at the tactical level of railroad freight transportation. This problem consists of determining paths between the origins and destinations of each shipment to minimize the operating and user costs while satisfying the railroad supply and demand restrictions. A mixed-integer program (MIP) is developed to find the optimal paths, and a new heuristic is developed to solve the proposed model. This heuristic decomposes the model into two sub-problems of manageable size and then provides feasible solutions. We discuss the performance of the proposed heuristic for a set of instances with up to 90 stations. A comparison with the CPLEX MIP solver shows that the heuristic gives the exact solution for 10 out of 15 instances. For the remaining instances, the heuristic obtained solutions within a tolerance of 0.03–0.84%. Furthermore, compared with the CPLEX MIP solver, the heuristic reduced the run time by an average of 85% for all 15 instances. Finally, we present the computational results of the heuristic applied to Iranian railroads. © 2017 Elsevier Inc
  6. Keywords:
  7. Decomposition method ; Mixed-integer programming ; Railroad blocking problem ; Economics ; Freight transportation ; Heuristic programming ; Integer programming ; Railroad transportation ; Railroads ; Computational results ; Decomposition methods ; Feasible solution ; Heuristic ; Mixed integer programming ; Mixed-integer programs ; Model formulation ; Supply and demand ; Heuristic methods
  8. Source: Applied Mathematical Modelling ; Volume 56 , 2018 , Pages 304-324 ; 0307904X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0307904X17306972