Approximation Algorithms for a New Truck Loading Problem in Urban Freight Transportation

References

• Anily S, Bramel J, Simchi-Levi D (1994) Worst-case analysis of heuristics for the bin packing problem with general cost structures. Oper. Res. 42(2):287–298.Link, Google Scholar
• Booker M (2012) What Chinese shoppers really do but will never tell you. China Shopper Report, Bain & Company, Boston.Google Scholar
• Babel L, Chen B, Kellerer H, Kotov V (2004) Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143(1–3):238–251.Crossref, Google Scholar
• Baldi MM, Bruglieri M (2017) On the generalized bin packing problem. Internat. Trans. Oper. Res. 24(3):425–438.Crossref, Google Scholar
• Baldi MM, Crainic TG, Perboli G, Tadei R (2012) The generalized bin packing problem. Transportation Res. Part E: Logist. Transportation Rev. 48(6):1205–1220.Crossref, Google Scholar
• Baldi MM, Manerba D, Perboli G, Tadei R (2019) A generalized bin packing problem for parcel delivery in last-mile logistics. Eur. J. Oper. Res. 274(3):990–999.Crossref, Google Scholar
• Barboza D (2015) China’s other e-commerce giant follows its own path. New York Times (January 27), https://www.nytimes.com/2015/01/27/business/international/jdcom-chinas-other-e-commerce-giant-follows-its-own-path.html.Google Scholar
• Bramel J, Rhee WT, Simchi-Levi D (1997) Average-case analysis of the bin-packing problem with general cost structures. Naval Res. Logist. 44(7):673–686.Crossref, Google Scholar
• Caprara A, Kellerer H, Pferschy U (2003) Approximation schemes for ordered vector packing problems. Naval Res. Logist. 50(1):58–69.Crossref, Google Scholar
• Coffman EG Jr, Leung JY-T (1979) Combinatorial analysis of an efficient algorithm for processor and storage allocation. SIAM J. Comput. 8(2):202–217.Crossref, Google Scholar
• Coffman EG Jr, Garey MR, Johnson DS (1983) Approximation algorithms for bin packing: An updated survey. Ausiello G, Lucertini M, Serafini P, eds. Algorithm Design for Computer System Design (Springer, Berlin), 49–106.Google Scholar
• Coffman EG Jr, Garey MR, Johnson DS (1997) Bin packing approximation algorithms: A survey. Hochbaum D, eds. Approximation Algorithms for NP-Hard Problems (PWS Publishing, Boston), 46–93.Google Scholar
• Coffman EG Jr, Leung JY-T, Ting DW (1978) Bin packing: Maximizing the number of pieces packed. Acta Inform. 9(3):263–271.Crossref, Google Scholar
• Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: Survey and classification. Pardalos PM, Du D-Z, Graham RL, eds. Handbook of Combinatorial Optimization (Springer Science+Business Media, New York), 455–531.Crossref, Google Scholar
• Denton BT, Miler AJ, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4-part-1):802–816.Google Scholar
• Epstein L, Levin A (2010) AFPTAS results for common variants of bin packing: A new method for handling the small items. SIAM J. Optim. 20(6):3121–3145.Crossref, Google Scholar
• Epstein L, Levin A (2012) Bin packing with general cost structures. Math. Programming Ser. A. 132(1–2):355–391.Crossref, Google Scholar
• Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within 1+ε in linear time. Combinatorica 1(4):349–355.Crossref, Google Scholar
• Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4):299–325.Crossref, Google Scholar
• Karmarkar N, Karp RM (1982) An efficient approximation scheme for the one-dimensional bin-packing problem. Proc. 23rd Annual Sympos. Foundations Comput. Sci. (FOCS) (IEEE Computer Science Society, New York), 312–320.Google Scholar
• Kellerer H, Pferschy U (1999) Cardinality constrained bin-packing problems. Ann. Oper. Res. 92(1):335–348.Crossref, Google Scholar
• Krause KL, Shen VY, Schwetman HD (1975) Analysis of several task scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22(4):522–550.Crossref, Google Scholar
• Meng J (2013) JD.com to boost logistics business. China Daily (October 24), http://www.chinadaily.com.cn/china/2013-10/24/content_17056855.htm.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
• Tadei R, Perboli G, Della Croce F (2002) A heuristic algorithm for the auto-carrier transportation problem. Transportation Sci. 36(1):55–62.Link, Google Scholar
• Wang S, Mozur P (2014) Buying is easy, delivery is hard. New York Times (November 12), https://www.nytimes.com/2014/11/12/technology/on-singles-day-in-china-a-push-to-improve-online-shoppings-slow-delivery.html.Google Scholar