Load Factor Optimization for the Auto Carrier Loading Problem
Published Online:17 Oct 2023https://doi.org/10.1287/trsc.2022.0373
References
- (1992) An optimization approach to the auto-carrier problem. PhD thesis, Case Western University, Cleveland.Google Scholar
- (1998) Optimizing auto-carrier loading. Transportation Sci. 32(2):174–188.Link, Google Scholar
- (2021) New strategy to improve the dotted board model for solving two dimensional cutting and packing problems. Comput. Indust. Engrg. 159:107467.Crossref, Google Scholar
- (2008) The geometry of nesting problems: A tutorial. Eur. J. Oper. Res. 184(2):397–415.Crossref, Google Scholar
- (2019) An exact formulation for the multi-period auto-carrier loading and transportation problem in Brazil. Comput. Indust. Engrg. 129:144–155.Crossref, Google Scholar
- (2007) Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1):27–49.Crossref, Google Scholar
- (2020) Downward compatible loading optimization with inter-set cost in automobile outbound logistics. Eur. J. Oper. Res. 287(1):106–118.Crossref, Google Scholar
- (2016) A heuristic algorithm for the auto-carrier loading problem. Internat. J. Shipping Transportation Logist. 8(1):21–50.Crossref, Google Scholar
- (2014) Optimization of a real-world auto-carrier transportation problem. Transportation Sci. 49(2):402–419.Link, Google Scholar
- (1990) A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2):145–159.Crossref, Google Scholar
- German Association of the Automotive Industry (2020) Annual Report 2020: The Automotive Industry in Facts and Figures. Report, Verband der Automobilindustrie, Berlin.Google Scholar
- (2022) Integrated vehicle routing problems: A survey. Salhi S, Boylan J, eds. The Palgrave Handbook of Operations Research (Springer, Cham, Switzerland), 73–103.Google Scholar
- (2022) Two-dimensional irregular packing problems: A review. Frontiers Mech. Engrg. 8.Google Scholar
- (2015) Finished-vehicle transporter routing problem solved by loading pattern discovery. Ann. Oper. Res. 234(1):37–56.Crossref, Google Scholar
- (2010) Routing problems with loading constraints. TOP 18(1):4–27.Crossref, Google Scholar
- (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Sci. 41(2):253–264.Link, Google Scholar
- (2020) Irregular packing problems: A review of mathematical models. Eur. J. Oper. Res. 282(3):803–822.Crossref, Google Scholar
- (2016) The vehicle loading problem with a heterogeneous transport fleet. Comput. Indust. Engrg. 97:137–145.Crossref, Google Scholar
- (2018) A general heuristic for two-dimensional nesting problems with limited-size containers. Internat. J. Production Res. 56(1–2):709–732.Crossref, Google Scholar
- (2000) Topos—A new constructive algorithm for nesting problems. OR Spectrum 22(2):263–284.Crossref, Google Scholar
- (2020) Two effective methods for the irregular knapsack problem. Appl. Soft Comput. 95:106485.Crossref, Google Scholar
- (2021) A survey of finished vehicle distribution and related problems from an optimization perspective. Transportation Res. Part E Logist. Transportation Rev. 149(2):102302.Crossref, Google Scholar
- (2002) A heuristic algorithm for the auto-carrier transportation problem. Transportation Sci. 36(1):55–62.Link, Google Scholar
- (2013) The dotted-board model: A new MIP model for nesting irregular shapes. Internat. J. Production Econom. 145(2):478–487.Crossref, Google Scholar
- (2012) Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape. Expert Systems Appl. 39(16):12589–12598.Crossref, Google Scholar
- (2016) Branch-and-price algorithm for an auto-carrier transportation problem. Working paper, Texas A&M University, College Station, TX.Google Scholar
- (2007) An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3):1109–1130.Crossref, Google Scholar

