Integrated planning for multiple types of locomotive work facilities under location, routing, and inventory considerations

Interfaces

Volumn 46, Issue 5, 2016, Pages 391-408

  Xie, Siyang ^a   Chen, Xi ^a   Wang, Zhaodong ^a   Ouyang, Yanfeng ^a   Somani, Kamalesh ^b   Huang, Jing ^b  

^a United States of America   (United States)

^b Operations Research Department   (United States)

Author keywords

Decomposition; Inventory; Large scale optimization; Multi type facility location; Railroad network; Routing

Indexed keywords

EID: 84991447043     PISSN: 00922102     EISSN: 1526551X     Source Type: Journal    
DOI: 10.1287/inte.2016.0857     Document Type: Article

References (33)

1. Ahmadi-Javid A, Seddighi AH (2013) A location-routing problem with disruption risk. Transportation Res. Part E 53(July):63-82.
2. Ahuja RK, Orlin JB, Pallottino S, Scaparra MP, Scutell� MG (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Management Sci. 50(6):749-760.
3. Belenguer J-M, Benavent E, Prins C, Prodhon C, Calvo RW (2011) A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38(6):931-941.
4. Campbell AM, Savelsbergh MWP (2004) A decomposition approach for the inventory-routing problem. Transportation Sci. 38(4):488-502.
5. Campbell A, Clarke L, Kleywegt A, Savelsbergh M (1998) The inventory routing problem. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Springer, New York), 95-113.
6. Chudak FA, Williamson DP (1999) Improved approximation algorithms for capacitated facility location problems. Wolsey LA, Nemhauser GL, eds. Integer Programming and Combinatorial Optimization (Springer, Berlin), 99-113.
7. Clark AJ, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4):475-490.
8. CSX Corporation (2015) Projects and partnerships: Fuel efficiency. Accessed June 27, 2015, https://www.csx.com/index.cfm/about-us/the-csx-advantage/fuel-efficiency/.
9. Daskin MS (1995) Network and Discrete Location: Models, Algorithms, and Applications (Wiley-Interscience, New York).
10. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342-354.
11. Geoffrion A, Bride RM (1978) Lagrangean relaxation applied to capacitated facility location problems. AIIE Trans. 10(1):40-47.
12. Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2):379-396.
13. Karlin S (1958) One stage inventory models with uncertainty. Arrow KJ, Karlin S, Scarf H, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 109-134.
14. Ke L, Feng Z (2013) A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 40(2):633-638.
15. Khuller S, Malekian A, Mestre J (2011) To fill or not to fill: The gas station problem. ACM Trans. Algorithms 7(3):Article no. 36.
16. Kuby M, Lim S (2005) The flow-refueling location problem for alternative-fuel vehicles. SocioEconomic Planning Sci. 39(2):125-145.
17. Kuby M, Lim S (2007) Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs. Networks Spatial Econom. 7(2):129-152.
18. Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur. J. Oper. Res. 6(2):224-226.
19. Laporte G, Louveaux F, Mercure H (1989) Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39(1):71-78.
20. Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multidepot vehicle routing and location-routing problems. Transportation Sci. 22(3):161-172.
21. Mazzola JB, Neebe AW (1999) Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type. Eur. J. Oper. Res. 115(2):285-299.
22. Nourbakhsh SM, Ouyang Y (2010) Optimal fueling strategies for locomotive fleets in railroad networks. Transportation Res. Part B 44(8):1104-1114.
23. Peng F, Kang S, Li X, Ouyang Y, Somani K, Acharya D (2011) A heuristic approach to the railroad track maintenance scheduling problem. Comput. Aided Civil Infrastructure Engrg. 26(2):129-145.
24. Pirkul H, Jayaraman V (1998) A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. Comput. Oper. Res. 25(10):869-878.
25. Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5):564-573.
26. Tai-Hsi W, Low C, Bai J-W (2002) Heuristic solutions to multidepot location-routing problems. Comput. Oper. Res. 29(10):1393-1415.
27. Toth P, Vigo D (2001) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).
28. Upchurch C, Kuby M, Lim S (2009) A model for location of capacitated alternative-fuel stations. Geographical Anal. 41(1):85-106.
29. Van Roy TJ (1986) A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1):145-163.
30. Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89-96.
31. Xie W, Ouyang Y (2013) Dynamic planning of facility locations with benefits from multitype facility colocation. Comput. Aided Civil Infrastructure Engrg. 28(9):666-678.
32. Xie W, Ouyang Y, Somani K (2014) Optimizing location and capacity for multiple types of locomotive maintenance shops. Comput. Aided Civil Infrastructure Engrg. 31(3):165-175.
33. Zouein PP, Abillama WR, Tohme E (2002) A multiple period capacitated inventory model for airline fuel management: A case study. J. Oper. Res. Soc. 53(4):379-386.