520
Views
5
CrossRef citations to date
0
Altmetric
Research Article

Combining Benders decomposition and column generation for scheduled service network design problem in rail freight transportation

ORCID Icon, ORCID Icon & ORCID Icon
Pages 1382-1404 | Received 16 Mar 2020, Accepted 06 Dec 2020, Published online: 23 Dec 2020

References

  • Andersen, Jardar, Marielle Christiansen, Teodor Gabriel Crainic, and Roar Grønhaug. 2011. “Branch and Price for Service Network Design with Asset Management Constraints.” Transportation Science 45 (1): 33–49.
  • Andersen, Jardar, Teodor Gabriel Crainic, and Marielle Christiansen. 2009. “Service Network Design with Asset Management: Formulations and Comparative Analyses.” Transportation Research Part C: Emerging Technologies 17 (2): 197–207.
  • Assad, Arjang A. 1980. “Models for Rail Transportation.” Transportation Research Part A: General 14 (3): 205–220.
  • Christiansen, Marielle, Kjetil Fagerholt, and David Ronen. 2004. “Ship Routing and Scheduling: Status and Perspectives.” Transportation Science 38 (1): 1–18.
  • Cordeau, Jean-Francois, Stojković Goran, Soumis Francois, and Desrosiers Jacques. 2001. “Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling.” Transportation Science 35 (4): 375–388.
  • Cordeau, Jean-Francois, Paolo Toth, and Daniele Vigo. 1998. “A Survey of Optimization Models for Train Routing and Scheduling.” Transportation Science 32 (4): 380–404.
  • Crainic, Teodor Gabriel. 2000. “Service Network Design in Freight Transportation.” European Journal of Operational Research 122 (2): 272–288.
  • Crainic, Teodor Gabriel, and Kap Hwan Kim. 2007. “Intermodal Transportation.” Handbooks in Operations Research and Management Science 14: 467–537.
  • Crainic, Teodor Gabriel, and Gilbert Laporte. 1997. “Planning Models for Freight Transportation.” European Journal of Operational Research 97 (3): 409–438.
  • Crainic, Teodor Gabriel, Hewitt Mike, Toulouse Michel, and Vu Duc Minh. 2014. “Service Network Design with Resource Constraints.” Transportation Science 50 (4): 1380–1393.
  • Crainic, Teodor Gabriel, Hewitt Mike, Toulouse Michel, and Vu Duc Minh. 2015. “Location and Service Network Design.” Technical Report Cirrelt. Centre interuniversitaire derecherche sur les réseaux d’entreprise, la logistique et le transport.
  • Crainic, Teodor Gabriel, and Jean-Marc Rousseau. 1986. “Multicommodity, Multimode Freight Transportation: A General Modeling and Algorithmic Framework for the Service Network Design Problem.” Transportation Research Part B: Methodological 20 (3): 225–242.
  • Desaulniers, Guy, June Lavigne, and Francois Soumis. 1998. “Multi-Depot Vehicle Scheduling Problems with Time Windows and Waiting Costs.” European Journal of Operational Research 111 (3): 479–494.
  • Lan, Zekang, Shiwei He, Rui Song, and Sijia Hao. 2019. “Optimizing Vehicle Scheduling Based on Variable Timetable by Benders-and-Price Approach.” Journal of Advanced Transportation 2019 (1): 1–13.
  • Lee, Chungmok, and Jinil Han. 2017. “Benders-and-Price Approach for Electric Vehicle Charging Station Location Problem Under Probabilistic Travel Range.” Transportation Research Part B: Methodological 106 (2): 130–152.
  • Linderoth, Jeff, and Stephen Wright. 2003. “Decomposition Algorithms for Stochastic Programming on a Computational Grid.” Computational Optimization and Applications 24 (2): 207–250.
  • Lübbecke, Marco E., and Jacques Desrosiers. 2005. “Selected Topics in Column Generation.” Operations Research 53 (6): 1007–1023.
  • Lysgaard, Jens, Adam N. Letchford, and Richard W. Eglese. 2004. “A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem.” Mathematical Programming 100 (2): 423–445.
  • Magnanti, Thomas L., and Richard T. Wong. 1981. “Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria.” Operations Research 29 (3): 464–484.
  • Mercier, Anne, Jean-François Cordeau, and François Soumis. 2005. “A Computational Study of Benders Decomposition for the Integrated Aircraft Routing and Crew Scheduling Problem.” Computers & Operations Research 32 (6): 1451–1476.
  • Papadakos, Nikolaos. 2008. “Practical Enhancements to the Magnanti–Wong Method.” Operations Research Letters 36 (4): 444–449.
  • Pedersen, Michael Berliner, Teodor Gabriel Crainic, and Oli BG Madsen. 2009. “Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements.” Transportation Science 43 (2): 158–177.
  • Rahmaniani, Ragheb, Teodor Gabriel Crainic, Gendreau Michel, and Rei Walter. 2017a. “The Benders Decomposition Algorithm: A Literature Review.” European Journal of Operational Research 259 (3): 801–817.
  • Rahmaniani, Ragheb, Teodor Gabriel Crainic, Gendreau Michel, and Rei Walter. 2017b. “A Benders Decomposition Method for Two-Stage Stochastic Network Design Problems.” CIRRELT – Interuniversity research Centre on Enterprise Networks, Logistics and Transportation, Montreal, QC, Canada, Tech. Rep., Apr. 2017.
  • Restrepo, María I., Bernard Gendron, and Louis-Martin Rousseau. 2018. “Combining Benders Decomposition and Column Generation for Multi-Activity Tour Scheduling.” Computers & Operations Research 93: 151–165.
  • Santoso, Tjendera, Ahmed Shabbir, Goetschalckx Marc, and Shapiro Alexander. 2005. “A Stochastic Programming Approach for Supply Chain Network Design Under Uncertainty.” European Journal of Operational Research 167 (1): 96–115.
  • Vanderbeck, François. 2011. “Branching in Branch-and-Price: A Generic Scheme.” Mathematical Programming 130 (2): 249–294.
  • Wieberneit, Nicole. 2008. “Service Network Design for Freight Transportation: A Review.” OR Spectrum 30 (1): 77–112.
  • Zeighami, Vahid, and François Soumis. 2019. “Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems.” Transportation Science 53 (5): 1479–1499.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.