An Integrated Approach to Tactical Transportation Planning in Logistics Networks

References

• Afentakis P, Gavish B (1986) Optimal lot-sizing algorithms for complex product structures. Oper. Res. 34(2):237–249.Link, Google Scholar
• Afentakis P, Gavish B, Karmarkar U (1984) Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems. Management Sci. 30(2):222–239.Link, Google Scholar
• Blumenfeld DE, Burns LD, Daganzo CF, Frick MC, Hall RW (1987) Reducing logistics costs at General Motors. Interfaces 17(1):26–47.Link, Google Scholar
• Burns LD, Hall RW, Blumenfeld DE, Daganzo CF (1985) Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33(3):469–490.Link, Google Scholar
• Cakir O (2009) Benders decomposition applied to multi-commodity, multi-mode distribution planning. Expert Systems Appl. 36(4):8212–8217.Crossref, Google Scholar
• Çetinkaya S (2005) Coordination of inventory and shipment consolidation decisions: A review of premises, models, and justification. Pardalos PM, Hearn D, Geunes J, Akçali E, Romeijn HE, Shen Z-JM, eds. Applications of Supply Chain Management and E-Commerce Research, Applied Optimization, Vol. 92 (Springer, New York), 3–51.Crossref, Google Scholar
• Chakrabarty D, Chekuri C, Khanna S, Korula N (2011) Approximability of capacitated network design. Günlük O, Woeginger GJ, eds. Integer Programming and Combinatoral Optimization (Springer, Berlin Heidelberg), 78–91.Crossref, Google Scholar
• Chan LMA, Muriel A, Shen Z-JM, Simchi-Levi D, Teo C-P (2002) Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. 48(11):1446–1460.Link, Google Scholar
• Chopra S, Meindl P (2007) Supply Chain Management: Strategy, Planning, and Operations (Pearson Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Chouman M, Crainic TG, Gendron B (2011) Commodity representations and cutset-based inequalities for multicommodity capacitated fixed-charge network design. Technical report, CIRRELT-2011-56. Université de Montréal. Centre de recherche sur les transports, Montréal.Google Scholar
• Clark AJ, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4):475–490.Link, Google Scholar
• Costa AM (2005) A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6):1429–1450.Crossref, Google Scholar
• Costa AM, Cordeau J-F, Gendron B (2009) Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42(3):371–392.Crossref, Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Crainic TG, Gendreau M (2002) Cooperative parallel tabu search for capacitated network design. J. Heuristics 8(6):601–627.Crossref, Google Scholar
• Crainic TG, Gendreau M, Farvolden JM (2000) A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12(3):223–236.Link, Google Scholar
• Crainic TG, Gendron B, Hernu G (2004) A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5):525–545.Crossref, Google Scholar
• Dobson G (1982) Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4):515–531.Link, Google Scholar
• Fischetti M, Salvagnin D, Zanette A (2010) A note on the selection of Benders’ cuts. Math. Program. 124(1–2):175–182.Crossref, Google Scholar
• Frangioni A, Gendron B (2009) 0-1 Reformulations of the multicommodity capacitated network design problem. Discrete Appl. Math. 157(6):1229–1241.Crossref, Google Scholar
• Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Management Sci. 20(5):822–844.Link, Google Scholar
• Geunes J, Pardalos PM (2003) Network optimization in supply chain management and financial engineering: An annotated bibliography. Networks 42(2):66–84.Crossref, Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.Link, Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M (2004) Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1):109–133.Crossref, Google Scholar
• Guisewite G, Pardalos P (1990) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Ann. Oper. Res. 25(1):75–99.Crossref, Google Scholar
• Jans R, Degraeve Z (2007) Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. Eur. J. Oper. Res. 177(3):1855–1875.Crossref, Google Scholar
• Jayaraman V (1998) Transportation, facility location and inventory issues in distribution network design: An investigation. Internat. J. Oper. Production Management 18(5):471–494.Crossref, Google Scholar
• Kempkes JP, Koberstein A, Suhl L (2010) A resource based mixed integer modelling approach for integrated operational logistics planning. Aalst W, Mylopoulos J, Rosemann M, Shaw MJ, Szyperski C, Dangelmaier W, Blecken A, Delius R, Klöpfer S, eds. Advanced Manufacturing and Sustainable Logistics, Lecture Notes in Business Information Processing, Vol. 46 (Springer, Berlin Heidelberg), 281–294.Crossref, Google Scholar
• Kim D, Pardalos PM (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4):195–203.Crossref, Google Scholar
• Kliewer G, Timajev L (2005) Relax-and-cut for capacitated network design. Brodal GS, Leonardi S, eds. Algorithms–ESA 2005, Lecture Notes in Computer Science, Vol. 3369 (Springer, Berlin Heidelberg), 47–58.Crossref, Google Scholar
• König FG, Matuschke J, Richter A (2012) Multi-dimensional commodity covering for tariff selection in transportation. Delling D, Liberti L, eds. 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012), OASICS, Vol. 25 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 58–70.Google Scholar
• Lueker GS (1975) Two NP-complete problems in nonnegative integer programming. Technical report, Princeton University Computer Science Laboratory, Princeton, NJ.Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
• Richey MB, Parker RG (1986) On multiple Steiner subgraph problems. Networks 16(4):423–438.Crossref, Google Scholar
• Schöneberg T, Koberstein A, Suhl L (2010) An optimization model for automated selection of economic and ecologic delivery profiles in area forwarding based inbound logistics networks. Flexible Services Manufacturing J. 22(3–4):214–235.Crossref, Google Scholar
• Simchi-Levi D, Kaminsky P, Simchi-Levi E (2003) Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies (McGraw Hill, New York).Google Scholar
• Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3):487–502.Link, Google Scholar
• Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89–96.Link, Google Scholar