Transportation Asset Acquisition under a Newsvendor Model with Cutting-Stock Restrictions: Approximation and Decomposition Algorithms

References

• Archetti C, Fernández E, Huerta-Muñoz DL (2017) The flexible periodic vehicle routing problem. Comput. Oper. Res. 85:58–70.Crossref, Google Scholar
• Baldacci R, Bartolini E, Mingozzi A, Valletta A (2011) An exact algorithm for the period routing problem. Oper. Res. 59(1):228–241.Link, Google Scholar
• Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. Golden B, Rahgavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, Boston), 3–27.Crossref, Google Scholar
• Baykasoğlu A, Subulan K, Taşan AS, Dudaklı N (2019) A review of fleet planning problems in single and multimodal transportation systems. Transportmetrica A Transportation Sci. 15(2):631–697.Crossref, Google Scholar
• Berge C, Johnson EL (1977) Coloring the edges of a hypergraph and linear programming techniques. Ann. Discrete Math. 1:65–78.Crossref, Google Scholar
• Bertsimas D, Delarue A, Jaillet P, Martin S (2019) Travel time estimation in the age of big data. Oper. Res. 67(2):498–515.Abstract, Google Scholar
• Boin R, Gavin R, Rau P, Stoffels J (2020) Getting the price right in logistics. Accessed March 2, 2023, https://www.mckinsey.com/industries/travel-logistics-and-infrastructure/our-insights/getting-the-price-right-in-logistics.Google Scholar
• Chen RR, Cheng T, Choi TM, Wang Y (2016) Novel advances in applications of the newsvendor model. Decision Sci. 47(1):8–10.Crossref, Google Scholar
• Chen Z, Fan WD (2020) Analyzing travel time distribution based on different travel time reliability patterns using probe vehicle data. Internat. J. Transportation Sci. Tech. 9(1):64–75.Crossref, Google Scholar
• Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119.Crossref, Google Scholar
• Crainic TG, Fomeni FD, Rei W (2021) Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. Comput. Oper. Res. 132:105308.Crossref, Google Scholar
• Crainic TG, Gobbato L, Perboli G, Rei W (2016) Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic. Eur. J. Oper. Res. 253(2):404–417.Crossref, Google Scholar
• Crainic TG, Gobbato L, Perboli G, Rei W, Watson JP, Woodruff DL (2014) Bin packing problems with uncertainty on item characteristics: An application to capacity planning in logistics. Procedia Soc. Behav. Sci. 111:654–662.Crossref, Google Scholar
• Faro M (2018) Optimizing strategic decision making in a multimodal transportation setting. Master’s thesis, Tilburg University, Tilburg, Netherlands. https://www.dropbox.com/sh/o579ummzbjy5z9a/AAD3y7MyBFqmeI-IETkjTN1ga?dl=0.Google Scholar
• Fragkos I, De Reyck B (2016) Improving the maritime transshipment operations of the noble group. Interfaces 46(3):203–217.Link, Google Scholar
• Guessous Y, Aron M, Bhouri N, Cohen S (2014) Estimating travel time distribution under different traffic conditions. Transportation Res. Procedia 3:339–348.Crossref, Google Scholar
• Hollander Y, Liu R (2008) Estimation of the distribution of travel times by repeated simulation. Transportation Res. Part C Emerging Tech. 16(2):212–231.Crossref, Google Scholar
• Hua G, Wang S, Cheng T (2012) Optimal pricing and order quantity for the newsvendor problem with free shipping. Internat. J. Production Econom. 135(1):162–169.Crossref, Google Scholar
• Jabali O, Gendreau M, Laporte G (2012) A continuous approximation model for the fleet composition problem. Transportation Res. Part B Methodological 46(10):1591–1606.Crossref, Google Scholar
• Jiang Y, Shang J, Liu Y (2013) Optimizing shipping-fee schedules to maximize e-tailer profits. Internat. J. Production Econom. 146(2):634–645.Crossref, Google Scholar
• Kantorovich LV (1960) Mathematical methods of organizing and planning production. Management Sci. 6(4):366–422.Link, Google Scholar
• Klosterhalfen S, Kallrath J, Fischer G (2014) Rail car fleet design: Optimization of structure and size. Internat. J. Production Econom. 157:112–119.Crossref, Google Scholar
• Loxton R, Lin Q, Teo KL (2012) A stochastic fleet composition problem. Comput. Oper. Res. 39(12):3177–3184.Crossref, Google Scholar
• Marcotte O (1985) The cutting stock problem and integer rounding. Math. Program. 33(1):82–92.Crossref, Google Scholar
• Martello S, Toth P (1990) Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28(1):59–70.Crossref, Google Scholar
• Meng Q, Wang S, Andersson H, Thun K (2014) Containership routing and scheduling in liner shipping: Overview and future research directions. Transportation Sci. 48(2):265–280.Link, Google Scholar
• Meng Q, Wang T (2011) A scenario-based dynamic programming model for multi-period liner ship fleet planning. Transportation Res. Part E Logist. Transportation Rev. 47(4):401–413.Crossref, Google Scholar
• Nitsche C, Scheithauer G, Terno J (1998) New cases of the cutting stock problem having MIRUP. Math. Methods Oper. Res. 48(1):105–115.Crossref, Google Scholar
• Noori-daryan M, Taleizadeh AA, Govindan K (2018) Joint replenishment and pricing decisions with different freight modes considerations for a supply chain under a composite incentive contract. J. Oper. Res. Soc. 69(6):876–894.Crossref, Google Scholar
• Nourinejad M, Roorda MJ (2017) A continuous approximation model for the fleet composition problem on the rectangular grid. OR Spectrum 39(2):373–401.Crossref, Google Scholar
• Padmanabhan D, Damla Ahipasaoglu S, Ramachandra A, Natarajan K (2021) Extremal probability bounds in combinatorial optimization. Preprint, submitted September 3, https://arxiv.org/abs/2109.01591.Google Scholar
• Pantuso G, Fagerholt K, Hvattum LM (2014) A survey on maritime fleet size and mix problems. Eur. J. Oper. Res. 235(2):341–349.Crossref, Google Scholar
• Poldi KC, Arenales MN (2009) Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Comput. Oper. Res. 36(6):2074–2081.Crossref, Google Scholar
• Scheithauer G, Terno J (1995) The modified integer round-up property of the one-dimensional cutting stock problem. Eur. J. Oper. Res. 84(3):562–571.Crossref, Google Scholar
• Simchi-Levi D (1994) New worst-case results for the bin-packing problem. Naval Res. Logist. 41(4):579–585.Crossref, Google Scholar
• Strathman JG, Hopper JR (1993) Empirical analysis of bus transit on-time performance. Transportation Res. Part A Policy Practice 27(2):93–100.Crossref, Google Scholar
• Wagenaar J, Fragkos I, Zuidwijk R (2021) Integrated planning for multimodal networks with disruptions and customer service requirements. Transportation Sci. 55(1):196–221.Link, Google Scholar
• Wolsey LA, Nemhauser GL (1999) Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, vol. 55 (John Wiley & Sons, New York).Google Scholar
• Yamada T, Russ BF, Castro J, Taniguchi E (2009) Designing multimodal freight transport networks: A heuristic approach and applications. Transportation Sci. 43(2):129–143.Link, Google Scholar