A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
Published Online:30 Mar 2022https://doi.org/10.1287/opre.2020.2032
References
- (1989) Network flows. Nemhauser G, Rinooy Kan A, Todd M, eds. Handbooks in Operations Research and Management Science, vol. 1 (Elsevier, New York), 211–369.Google Scholar
- (2015) Comparison of solution approaches for the train load planning problem in seaport terminals. Transporation Res., Part E Logist. Transportation Rev. 79:65–82.Crossref, Google Scholar
- (2016) A multi-objective sustainable load planning model for intermodal transportation networks with a real-life application. Transporation Res., Part E Logist. Transportation Rev. 95:207–247.Crossref, Google Scholar
- (2007) Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1):3–17.Crossref, Google Scholar
- (1962) Partitioning procedures for solving mixed-variables programming problems. Numerical Math. 4(1):238–252.Crossref, Google Scholar
- BITRE (2014) Containerised and non-containerised trade through Australian ports to 2032–33. Research report, BITRE, Canberra, ACT, Australia.Google Scholar
- BITRE (2016) Why short-haul intermodal rail services succeed. Research report, BITRE, Canberra, ACT, Australia.Google Scholar
- (1992) Very large-scale linear programming: A case study in combining interior point and simplex methods. Oper. Res. 40(5):885–897.Link, Google Scholar
- (2019) Implementing Automatic Benders Decomposition in a Modern MIP Solver (Optimization Online).Google Scholar
- (1998) The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49(8):799–805.Crossref, Google Scholar
- (2018) Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm. Appl. Math. Comput. 318:298–311.Google Scholar
- (2019) “Facet” separation with one linear program. Math. Programming 178(1):361–380.Crossref, Google Scholar
- (2015) Modeling dry-port-based freight distribution planning. Transportation Res., Part C Emerging Tech. 55:518–534.Crossref, Google Scholar
- (1992) Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60(3):273–279.Crossref, Google Scholar
- (2015) Geometric versions of the three-dimensional assignment problem under general norms. Discrete Optim. 18:38–55.Crossref, Google Scholar
- (1998) OpenMP: An industry standard API for shared-memory programming. Comput. Sci. Engrg. IEEE 5(1):46–55.Crossref, Google Scholar
- (2016) An agent-based framework for cooperative planning of intermodal freight transport chains. Transportation Res., Part C Emerging Tech. 64:72–85.Crossref, Google Scholar
- (2010) A note on the selection of Benders’ cuts. Math. Programming 124(1–2):175–182.Crossref, Google Scholar
- (2016) Decomposition approach for integrated intermodal logistics network design. Transporation Res., Part E Logist. Transportation Rev. 89:53–69.Crossref, Google Scholar
- (2016a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72:12–30.Crossref, Google Scholar
- (2016b) A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands. Transportation Res. Part B: Methodological 91:34–51.Crossref, Google Scholar
- Gurobi Optimization LLC (2018) Gurobi Optimizer reference manual. Accessed March 14, 2019, http://www.gurobi.com.Google Scholar
- IBM Corporation (2017) IBM ILOG CPLEX Optimization Studio CPLEX user’s manual. Accessed March 14, 2019, http://www.ibm.com/analytics/cplex-optimizer.Google Scholar
- (2014) The family of vehicle routing problems. Vehicle Routing. MOS-SIAM Series on Optimization (Society for Industrial and Applied Mathematics, Philadelphia), 1–33.Crossref, Google Scholar
- (1972) Reducibility Among Combinatorial Problems (Springer US, Boston, MA).Crossref, Google Scholar
- (2015) Intermodal freight transport planning: A receding horizon control approach. Transportation Res., Part C Emerging Tech. 60:77–95.Crossref, Google Scholar
- (2016) Distributed model predictive control for cooperative synchromodal freight transport. Transportation Res., Part E Logist. Transportation Rev. 105:240–260.Google Scholar
- (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
- (2019) The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems. Comput. Oper. Res. 104:375–393.Crossref, Google Scholar
- (2005) The Generalized Assignment Problem and Extensions (Springer US, Boston, MA).Crossref, Google Scholar
- (2013) A truck scheduling problem arising in intermodal container transportation. Eur. J. Oper. Res. 230(3):666–680.Crossref, Google Scholar
- NSW Ports (2015) Navigating the future: NSW Ports’ 30 year master plan. Master plan report, NSW Ports, Port Botany, NSW, Australia.Google Scholar
- (2008) Practical enhancements to the Magnanti-Wong method. Oper. Res. Lett. 36(4):444–449.Crossref, Google Scholar
- (2015) A bilevel storage pricing model for outbound containers in a dry port system. Transportation Res., Part E Logist. Transportation Rev. 73:65–83.Crossref, Google Scholar
- (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
- (2016) Optimization of the drayage problem using exact methods. Inform. Systems Oper. Res. 54(1):33–51.Crossref, Google Scholar
- (2010) The multi-shift vehicle routing problem with overtime. Comput. Oper. Res. 37(11):1987–1998.Crossref, Google Scholar
- (2010) Accelerating Benders method using covering cut bundle generation. Internat. Trans. Oper. Res. 17(2):221–237.Crossref, Google Scholar
- (1982) Equivalent weights for lexicographic multi-objective programs: Characterizations and computations. Eur. J. Oper. Res. 11(4):367–379.Crossref, Google Scholar
- (2013) On generating maximal nondominated Benders cuts. Ann. Oper. Res. 210(1):57–72.Crossref, Google Scholar
- (1983) Preemptive and nonpreemptive multi-objective programming: Relationship and counterexamples. J. Optim. Theory Appl. 39(2):173–186.Crossref, Google Scholar
- (1996) Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91(3):611–618.Crossref, Google Scholar
- (2013) A tabu search heuristic for the inland container transportation problem. Comput. Oper. Res. 40(4):953–962.Crossref, Google Scholar
- (2017) Discrete intermodal freight transportation network design with route choice behavior of intermodal operators. Transportation Res. Part B: Methodological 95:76–104.Crossref, Google Scholar
- (2013) Scheduling for inland container truck and train transportation. Internat. J. Production Econom. 143(2):349–356.Crossref, Google Scholar
- (2018) A review and analysis of the investment in, and cost structure of, intermodal rail terminals. Transportation Rev. 38(1):33–51.Crossref, Google Scholar
- (2014) Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal. Eur. J. Oper. Res. 235(2):461–469.Crossref, Google Scholar
- (2016) Synchromodal hinterland freight transport: Model study for the port of Rotterdam. J. Transportation Geography 52:1–10.Crossref, Google Scholar
- (2014) Container drayage problem with flexible orders and its near real-time solution strategies. Transportation Res., Part E Logist. Transportation Rev. 61:235–251.Crossref, Google Scholar

