Release Time Scheduling and Hub Location for Next-Day Delivery

References

• Alumur S, Kara BY. Network hub location problems: The state of the art. Eur. J. Oper. Res. (2008) 190(1):1–21Crossref, Google Scholar
• Alumur SA, Kara BY. A hub covering network design problem for cargo applications in Turkey. J. Oper. Res. Soc. (2009) 60(10):1349–1359Crossref, Google Scholar
• Alumur SA, Kara BY, Karasan OE. The design of single allocation incomplete hub networks. Transportation Res. Part B (2009) 43(10):936–951Crossref, Google Scholar
• Baumgartner S. Polyhedral analysis of hub center problems. (2003) . Diploma thesis, Universitat Kaiserslautern, Kaiserslautern, GermanyGoogle Scholar
• Campbell JF. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994) 72(2):387–405Crossref, Google Scholar
• Campbell JF. Hub location and the p-hub median problem. Oper. Res. (1996) 44(6):923–935Link, Google Scholar
• Campbell JF. Hub location for time definite transportation. Comput. Oper. Res. (2009) 36(12):3107–3116Crossref, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M, Drezner Z, Hamacher H. Hub location problems. Facility Location: Applications and Theory (2002) (Springer-Verlag, Berlin) 373–408Crossref, Google Scholar
• Canovas L, Garcia S, Marin A. Solving the uncapacitated multiple allocation hub location problem by means of a dual ascent technique. Eur. J. Oper. Res. (2007) 179(3):990–1007Crossref, Google Scholar
• Chen H, Campbell AM, Thomas BW. Network design for time-constrained delivery. Naval Res. Logist. (2008) 55(6):493–515Crossref, Google Scholar
• Chen JF. A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega (2007) 35(2):211–220Crossref, Google Scholar
• Costa MG, Captivo ME, Climaco J. Capacitated single allocation hub location problem—A bi-criteria approach. Comput. Oper. Res. (2008) 35(11):3671–3695Crossref, Google Scholar
• Cunha CB, Silva MR. A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur. J. Oper. Res. (2007) 179(3):747–758Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. (1996) 4(3):139–154Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M. Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. (1999) 86:141–159Crossref, Google Scholar
• Ernst AT, Hamacher H, Jiang H, Krishnamoorthy M, Woeginger G. Uncapacitated single and multi allocation p-hub center problems. Comput. Oper. Res. (2009) 36(7):2230–2241Crossref, Google Scholar
• Hall RW. Configuration of an overnight package air network. Transportation Res. Part A (1989) 23(2):139–149Crossref, Google Scholar
• Hall RW. Pickup and delivery systems for overnight carriers. Transportation Res. Part A (1996) 30(3):173–187Google Scholar
• Hamacher HW, Labbé M, Nickel S, Sonneborn T. Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. (2004) 145(1):104–116Crossref, Google Scholar
• Kara BY, Taner MR, Eiselt HA, Marianov V. Hub location problems: The location of interacting facilities. Foundations of Location Analysis (2011) (Springer, New York) 273–288Crossref, Google Scholar
• Kara BY, Tansel BC. On the single assignment p-hub center problem. Eur. J. Oper. Res. (2000) 125(3):648–655Crossref, Google Scholar
• Kara BY, Tansel BC. The latest arrival hub location problem. Management Sci. (2001) 47(10):1408–1420Link, Google Scholar
• Kara BY, Tansel BC. The single assignment hub covering problem: Models and linearizations. J. Oper. Res. Soc. (2003) 54(1):59–64Crossref, Google Scholar
• Kuby MJ, Gray RG. The hub network design problem with stopover and feeders: The case of Federal Express. Transportation Res. Part A (1993) 27(1):1–12Crossref, Google Scholar
• Labbé M, Yaman H. Projecting the flow variables for hub location problems. Networks (2004) 44(2):84–93Crossref, Google Scholar
• Labbé M, Yaman H, Gourdin E. A branch and cut algorithm for hub location problems with single assignment. Math. Programming (2005) 102(2):371–405Crossref, Google Scholar
• Lin C-C. The freight routing problem of time-definite freight delivery common carriers. Transportation Res. B (2001) 35(6):525–547Crossref, Google Scholar
• Lin C-C, Chen S-H. The hierarchical network design problem for time-definite express common carriers. Transportation Res. B (2004) 38(3):271–283Crossref, Google Scholar
• Lin CC, Lin YJ, Lin DY. The economic effects of center-to-center directs on hub-and-spoke networks for air express common carriers. J. Air Transport Management (2003) 9(4):255–265Crossref, Google Scholar
• Marin A, Canovas L, Landete M. New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. (2006) 172(1):393–404Crossref, Google Scholar
• Marsten RE, Muller MR. A mixed-integer programming approach to air cargo fleet planning. Management Sci. (1980) 26(11):1096–1107Link, Google Scholar
• Meyer T, Ernst AT, Krishnamoorthy M. A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. (2009) 36(12):3143–3151Crossref, Google Scholar
• O'Kelly ME. The location of interacting hub facilities. Transportation Sci. (1986) 20(2):92–105Link, Google Scholar
• O'Kelly ME. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32(3):393–404Crossref, Google Scholar
• O'Kelly ME. Hub facility location with fixed costs. Papers Regional Sci. (1992) 71(3):293–306Crossref, Google Scholar
• O'Kelly ME, Bryan D, Skorin-Kapov D, Skorin-Kapov J. Hub network design with single and multiple allocation: A computational study. Location Sci. (1996) 4(3):125–138Crossref, Google Scholar
• Pamuk FS, Sepil C. A solution to the hub center problem via a single-relocation algorithm with tabu search. IIE Trans. (2001) 33(5):399–411Crossref, Google Scholar
• Sherali HD. On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. (2001) 28(4):155–160Crossref, Google Scholar
• Silva MR, Cunha CB. New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. (2009) 36(12):3152–3165Crossref, Google Scholar
• Sim T, Lowe TJ, Thomas BW. The stochastic p-hub center problem with service-level constraints. Comput. Oper. Res. (2009) 36(12):3166–3177Crossref, Google Scholar
• Skorin-Kapov D, Skorin-Kapov J, O'Kelly ME. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. (1996) 94(3):582–593Crossref, Google Scholar
• Tan PZ, Kara BY. A hub covering model for cargo delivery systems. Networks (2007) 49(1):28–39Crossref, Google Scholar
• Topcuoglu H, Corut F, Ermis M, Yilmaz G. Solving the uncapacitated hub location problem using genetic algorithms. Comput. Oper. Res. (2005) 32(4):967–984Crossref, Google Scholar
• Wagner B. Model formulations for hub covering problems. J. Oper. Res. Soc. (2008) 59(7):932–938Crossref, Google Scholar
• Yaman H. The hierarchical hub median problem with single assignment. Transportation Res. Part B (2009) 43(6):643–658Crossref, Google Scholar
• Yaman H, Kara BY, Tansel BC. The latest arrival hub location problem for cargo delivery systems with stopovers. Transportation Res. Part B (2007) 41(8):906–919Crossref, Google Scholar