Computational and Applied Mathematics

, Volume 37, Issue 2, pp 819–851 | Cite as

Flow shipment scheduling in an incomplete hub location-routing network design problem

Article

Abstract

This paper addresses flow shipment scheduling in the hub location-routing problem in which the hub network is not fully interconnected. The aim is to allocate each node to the located hub(s) and to schedule the departure time from the nodes. The proposed integer programming model in this paper, which is inspired by a real-life problem such as postal delivery systems, ensures that the predetermined flow is delivered at the given service time. Moreover, the model solves the problem when the flow arrival demonstrates a piecewise linear pattern. Several classes of preprocessing steps are introduced to solve the model. Computational results obtained from CAB, AP, and a new dataset for Iranian road network (IRN) confirm the efficiency of the proposed preprocessing. In fact, averagely, the run times for CAB, AP, and IRN are reduced by 75.57, 80.41, and 82.96 %, respectively, when the model is solved by preprocessing. Moreover, on average, the number of nodes in the branch and cut tree is decreased by 90.87, 95.67, and 95.86 % for CAB, AP, and IRN, respectively, using the presented preprocessing.

Keywords

Hub location Routing Incomplete network Flow shipment scheduling Preprocessing 

Mathematics Subject Classification

90B06 

References

  1. Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–12MathSciNetCrossRefMATHGoogle Scholar
  2. Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79:501–523CrossRefMATHGoogle Scholar
  3. Bryan DL, O’Kelly ME (1999) Hub-and-spoke networks in air transportation: an analytical review. J Reg Sci 39:275–295CrossRefGoogle Scholar
  4. Campbell JF (1994a) A survey of network hub location. Stud Locat Anal 6:31–49Google Scholar
  5. Campbell JF (1994b) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–4CrossRefMATHGoogle Scholar
  6. Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36:3107–3116CrossRefMATHGoogle Scholar
  7. Campbell JF, Ernst AT, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location, applications and theory. Springer, BerlinGoogle Scholar
  8. Carello G, Della Croce F, Ghirardi M, Tadei R (2004) Solving the hub location problem in telecommunication network design: a local search approach. Networks 44:94–105MathSciNetCrossRefMATHGoogle Scholar
  9. Catanzaro D, Gourdin E, Labbé M, Özsoy FA (2011) A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput Oper Res 38:539–549Google Scholar
  10. Chen H, Campbell AM, Thomas BW (2008) Network design for time-constrained delivery. Nav Res Log 55:493–511MathSciNetCrossRefMATHGoogle Scholar
  11. Chiu S, Lee Y, Ryan J (1995) A Steiner ring star problem in designing survivable telecommunication networks. In Informs National Meeting, New OrleansGoogle Scholar
  12. Chou YH (1990) The hierarchical-hub model for airline networks. Transport Plan Techn 14:243–258CrossRefGoogle Scholar
  13. Contreras I, Fernández E, Marín A (2009) Tight bounds from a path based formulation for the tree of hub location problem. Comput Oper Res 36:3117–3127CrossRefMATHGoogle Scholar
  14. Davari S, Fazel Zarandi MH, Turksen IB (2013) The incomplete hub-covering location problem considering imprecise location of demands. Scientia Iranica 20:983–991Google Scholar
  15. Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Loc sci 4:139–154CrossRefMATHGoogle Scholar
  16. Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Survey: Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64:1096–1109CrossRefGoogle Scholar
  17. Gelareh S (2008) Hub location models in public transport planning. Dissertation. University of Technology, KaiserslauternGoogle Scholar
  18. Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transp Res E Log 47:1092–1111CrossRefGoogle Scholar
  19. Ishfaq R (2012) LTL logistics networks with differentiated services. Comput Oper Res 39:2867–2879MathSciNetCrossRefMATHGoogle Scholar
  20. Karimi H, Bashiri M (2011) Hub covering location problems with different coverage types. Scientia Iranica 18:1571–1578CrossRefGoogle Scholar
  21. Karimi H, Setak M (2014) Proprietor and customer costs in the incomplete hub location-routing network topology. Appl Math Modell 38:1011–1023MathSciNetCrossRefGoogle Scholar
  22. Kewcharoenwong P, Üster H (2014) Benders decomposition algorithms for the fixed-charge relay network design in telecommunications. Telecommun Syst 56(4):441–453CrossRefGoogle Scholar
  23. Kim JG, Tcha DW (1992) Optimal design of a two-level hierarchical network with tree-star configuration. Comput Ind Eng 22:273–281CrossRefGoogle Scholar
  24. Klincewicz JG (1998) Hub location in backbone/tributary network design: a review. Loc Sci 6:307–335CrossRefGoogle Scholar
  25. Lee CH, Ro HB, Tcha DW (1993) Topological design of a two-level network with ring-star configuration. Comput Oper Res 20(6):625–637CrossRefMATHGoogle Scholar
  26. Liu J, Li CL, Chan CY (2003) Mixed truck delivery systems with both hub-and-spoke and direct shipment. Transp Res E Log 39:325–339CrossRefGoogle Scholar
  27. Lin CC, Chen SH (2004) The hierarchical network design problem for time-definite express common carriers. Transp Res B-Method 38:271–283CrossRefGoogle Scholar
  28. Mahmutoğulları Aİ, Kara BY (2015) Hub location problem with allowed routing between non hub nodes. Geogr Anal 47:410–430CrossRefGoogle Scholar
  29. Nickel S, Schöbel A, Sonneborn T (2001) Hub location problems in urban traffic networks. In: Pursula M, Niittymäki J (eds) Mathematical methods on optimization in transportation systems. Kluwer Academic Publishers, Berlin, pp 95–107Google Scholar
  30. O’Kelly ME (1986) The location of interacting hub facilities. Transp Sci 20:92–106CrossRefGoogle Scholar
  31. O’kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404Google Scholar
  32. O’Kelly ME, Bryan DL (1998) Hub location with flow economies of scale. Transp Res B Meth 32:605–616CrossRefGoogle Scholar
  33. O’Kelly ME, Miller HJ (1994) The hub network design problem—a review and synthesis. J Transp Geogr 2:31–40CrossRefGoogle Scholar
  34. Peker M, Kara BY (2015) The P-hub maximal covering problem and extensions for gradual decay functions. Omega 54:158–172CrossRefGoogle Scholar
  35. Setak M, Karimi H, Rastani S (2013) Designing incomplete hub location-routing network in urban transportation problem. Int J Eng Trans C Asp 26:997–1006Google Scholar
  36. Song DP, Carter J (2008) Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Nav Res Log 55:156–171MathSciNetCrossRefMATHGoogle Scholar
  37. Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under non-restrictive policy. Eur J Oper Res 132(1):88–105MathSciNetCrossRefMATHGoogle Scholar
  38. Tan PZ, Kara BY (2008) A hub covering model for cargo delivery systems. Networks 49:28–39MathSciNetCrossRefMATHGoogle Scholar
  39. Yaman H, Kara BY, Tansel BÇ (2007) The latest arrival hub location problem for cargo delivery systems with stopovers. Transport Res B-Method 41:906–919CrossRefGoogle Scholar
  40. Yaman H, Karasan OE, Kara BY (2012) Release time scheduling and hub location for next-day delivery. Oper Res 60:906–917MathSciNetCrossRefMATHGoogle Scholar
  41. Yoon MG, Beak YH, Tcha DW (2000) Optimal design model for a distributed hierarchical network with a fixed charged. Int J Manag Sci 6:29–45Google Scholar
  42. Yoon MG, Current J (2008) The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J Oper Res Soc 59:80–89CrossRefMATHGoogle Scholar

Copyright information

© SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional 2016

Authors and Affiliations

  1. 1.Department of Industrial EngineeringUniversity of BojnordBojnordIran
  2. 2.Faculty of Industrial EngineeringK.N. Toosi University of TechnologyTehranIran

Personalised recommendations