Multimodal Express Package Delivery: A Service Network Design Application

References

• Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, N.J) Google Scholar
• Assad A. A. Multicommodity network flows—A survey. Networks (1978) 8 37 91 Crossref, Google Scholar
• Balarishnan A. , Magnanti T. L. , Wong R. A dual-ascent procedure for large-scale uncapacitated network design. Opns. Res. (1989) 37 716 740 Link, Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. A dual-based algorithm for multilevel network design. Management Sci. (1994a) 40 567 581 Link, Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Sci. (1994b) 40 846 867 Link, Google Scholar
• Balakrishnan A. , Manganti T. L. , Wong R. T. A decomposition algorithm for local access telecommunications network expansion planning. Opns. Res. (1995) 43 58 76 Link, Google Scholar
• Barnhart C. , Schneur R. R. Air network design for express shipment service. Opns. Res. (1996) 44 852 863 Link, Google Scholar
• Bienstock D. , Gunluk O. Capacitated network design—Polyhedral structure and computation. (1994) . Working paper, Columbia University, New York Google Scholar
• Billheimer J. W. , Gray P. Network design with fixed and variable cost elements. Transportation Sci. (1973) 7 49 74 Link, Google Scholar
• Chang S. , Gavish B. Lower bounding procedures for multiperiod telecommunications network expansion problems. Opns. Res. (1995) 43 43 57 Link, Google Scholar
• Clarke L. W. , Gong P. Capacitated network design with column generation. (1995) . Working paper LEC-96-06, The Logistics Institute, School of Industrial and System Engineering, Georgia Institute of Technology, Atlanta, GA Google Scholar
• CPLEX Optimization, Inc. (1995) . Using the CPLEX callable library, version 4.0. CPLEX Optimization, Inc., Incline Village, NV Google Scholar
• Crainic T. G. , Rousseau J. M. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Res. (1986) 20B 225 242 Crossref, Google Scholar
• Farvolden J. M. , Powell W. B. Subgradient methods for the service network design problem. Transportation Sci. (1994) 28 256 272 Link, Google Scholar
• Gendron B. , Crainic T. G. Relaxations for multicommodity capacitated network design problems. (1994) . Working paper, Centre de recherche sur les transports, Publication #965, Université de Montréal, Montréal, Canada Google Scholar
• Hane C. A. , Barnhart C. , Johnson E. L. , et al. The fleet assignment problem: Solving a large-scale integer program. Math. Prog. (1995) 70 211 232 Crossref, Google Scholar
• International Business Machine Corp. IBM optimization subroutine library (OSL) guide and reference. IBM Systems J. (1992) 31 . SC23-0519 Google Scholar
• Jones K. L. , Lustig I. J. , Farvolden J. M. , Powell W. B. Multicommodity network flows: The impact of formulation on decomposition. Math. Prog. (1993) 62 95 117 Crossref, Google Scholar
• Kennington J. L. A survey of linear cost multicommodity network flows. Opns. Res. (1978) 26 209 236 Link, Google Scholar
• Kim D. Large scale transportation service network design: Models, algorithms and applications. (1997) . Ph.D. thesis, Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, MA Google Scholar
• Kuby M. J. , Gray R. G. The hub network design problem with stopovers and feeders: The case of federal express. Trans. Res. A (1993) 27A 1 12 Google Scholar
• Lamar B. W. , Sheffi Y. , Powell W. B. A capacity improvement lower bound for fixed charge network design problem. Opns. Res. (1990) 38 704 710 Link, Google Scholar
• Leung J. M. Y. , Magnanti T. L. , Singhal V. Routing point-to-point delivery systems: Formulation and heuristics. Transportation Sci. (1990) 24 245 260 Link, Google Scholar
• Magnanti T. L. , Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18 1 55 Link, Google Scholar
• Magnanti T. L. , Mireault P. , Wong R. Tailoring benders decomposition for uncapacitated network design problem. Math. Prog. (1986) 26 112 154 Crossref, Google Scholar
• Magnanti T. L. , Mirchandani P. , Vachani R. Modeling and solving the two-facility capacitated network loading problem. Opns. Res. (1995) 43 142 157 Link, Google Scholar
• Medhi D. , Tipper D. On some approaches to solving a multi-hour communications network design problem. (1995) . Working paper, Computer Science Telecommunications, University of Missouri–Kansas City, Kansas City, KS Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19 313 360 Crossref, Google Scholar
• Nemhauser G. L. , Salvelsbergh M. W. P. , Sigismondi G. C. MINTO, a mixed INTeger optimizer. Opns. Res. Lett. (1994) 15 47 58 Crossref, Google Scholar
• Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (John Wiley and Sons, Inc., Chichester, U.K.) Crossref, Google Scholar
• Newton H. N. Network design under budget constraints with application to the railroad blocking problem. (1996) . Ph.D. thesis, Industrial and Systems Engineering, Auburn University, Auburn, AL Google Scholar
• Powell W. B. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. (1986) 20 246 257 Link, Google Scholar
• Powell W. B. , Sheffi Y. Design and implementation of an interactive optimization system for network design in the motor carrier industry. Opns. Res. (1989) 37 12 29 Link, Google Scholar