Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations

In North America, thousands of locomotives operating in the railroad network require various types of mechanical work every day. This work may be unscheduled, periodic, or on demand and could be conducted at either a fixed facility or a movable facility. Each facility is characterized by the type of work it can provide. The long-term infrastructure planning of these facilities is vital to the efficiency of the railroad. In this paper, we develop a large-scale mixed-integer mathematical model for infrastructure planning. The model integrates and optimizes decisions about (1) Locations, capabilities, and capacities of fixed facilities, (2) Home locations and routing plans of movable facilities, and (3) Assignments of locomotive work demands to facilities. We propose a decomposition-based heuristic solution framework consisting of several underlying algorithms to solve this large-scale optimization model. Computational results on numerous scenario studies using field data from the railroad industry show that...

[1]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[2]  Yanfeng Ouyang,et al.  Optimizing Location and Capacity for Multiple Types of Locomotive Maintenance Shops , 2016, Comput. Aided Civ. Infrastructure Eng..

[3]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[4]  Zuren Feng,et al.  A two-phase metaheuristic for the cumulative capacitated vehicle routing problem , 2013, Comput. Oper. Res..

[5]  Hasan Pirkul,et al.  A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution , 1998, Comput. Oper. Res..

[6]  Maria Paola Scaparra,et al.  Sloan School of Management Working Paper 4387-02 October 2002 A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM , 2002 .

[7]  M. Kuby,et al.  A Model for Location of Capacitated Alternative-Fuel Stations , 2009 .

[8]  Michael Kuby,et al.  The flow-refueling location problem for alternative-fuel vehicles , 2005 .

[9]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[10]  Pierrette P. Zouein,et al.  A multiple period capacitated inventory model for airline fuel management: a case study , 2002, J. Oper. Res. Soc..

[11]  Herbert E. Scarf,et al.  Optimal Policies for a Multi-Echelon Inventory Problem , 1960, Manag. Sci..

[12]  Michael Kuby,et al.  Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs , 2007 .

[13]  Yanfeng Ouyang,et al.  Dynamic Planning of Facility Locations with Benefits from Multitype Facility Colocation , 2013, Comput. Aided Civ. Infrastructure Eng..

[14]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

[15]  Samir Khuller,et al.  To fill or not to fill: The gas station problem , 2007, TALG.

[16]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[17]  Joseph B. Mazzola,et al.  Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type , 1999, Eur. J. Oper. Res..

[18]  Martin W. P. Savelsbergh,et al.  A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..

[19]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[20]  Yanfeng Ouyang,et al.  Optimal fueling strategies for locomotive fleets in railroad networks , 2010 .

[21]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[22]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[23]  David P. Williamson,et al.  Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.

[24]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[25]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[26]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[27]  Yanfeng Ouyang,et al.  A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem , 2011, Comput. Aided Civ. Infrastructure Eng..

[28]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[29]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[30]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[31]  Amir Ahmadi-Javid,et al.  A location-routing problem with disruption risk , 2013 .

[32]  Pierrette P. Zouein,et al.  A multiple period capacitated inventory model for airline fuel management , 2002 .