Skip to main content
SpringerLink
Log in

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

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–12

    Article  MathSciNet  MATH  Google Scholar 

  • Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79:501–523

    Article  MATH  Google Scholar 

  • Bryan DL, O’Kelly ME (1999) Hub-and-spoke networks in air transportation: an analytical review. J Reg Sci 39:275–295

    Article  Google Scholar 

  • Campbell JF (1994a) A survey of network hub location. Stud Locat Anal 6:31–49

    Google Scholar 

  • Campbell JF (1994b) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–4

    Article  MATH  Google Scholar 

  • Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36:3107–3116

    Article  MATH  Google Scholar 

  • Campbell JF, Ernst AT, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location, applications and theory. Springer, Berlin

  • 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–105

    Article  MathSciNet  MATH  Google Scholar 

  • 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–549

  • Chen H, Campbell AM, Thomas BW (2008) Network design for time-constrained delivery. Nav Res Log 55:493–511

    Article  MathSciNet  MATH  Google Scholar 

  • Chiu S, Lee Y, Ryan J (1995) A Steiner ring star problem in designing survivable telecommunication networks. In Informs National Meeting, New Orleans

  • Chou YH (1990) The hierarchical-hub model for airline networks. Transport Plan Techn 14:243–258

    Article  Google Scholar 

  • 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–3127

    Article  MATH  Google Scholar 

  • Davari S, Fazel Zarandi MH, Turksen IB (2013) The incomplete hub-covering location problem considering imprecise location of demands. Scientia Iranica 20:983–991

    Google Scholar 

  • Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Loc sci 4:139–154

    Article  MATH  Google Scholar 

  • 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–1109

    Article  Google Scholar 

  • Gelareh S (2008) Hub location models in public transport planning. Dissertation. University of Technology, Kaiserslautern

  • Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transp Res E Log 47:1092–1111

    Article  Google Scholar 

  • Ishfaq R (2012) LTL logistics networks with differentiated services. Comput Oper Res 39:2867–2879

    Article  MathSciNet  MATH  Google Scholar 

  • Karimi H, Bashiri M (2011) Hub covering location problems with different coverage types. Scientia Iranica 18:1571–1578

    Article  Google Scholar 

  • Karimi H, Setak M (2014) Proprietor and customer costs in the incomplete hub location-routing network topology. Appl Math Modell 38:1011–1023

    Article  MathSciNet  Google Scholar 

  • Kewcharoenwong P, Üster H (2014) Benders decomposition algorithms for the fixed-charge relay network design in telecommunications. Telecommun Syst 56(4):441–453

    Article  Google Scholar 

  • Kim JG, Tcha DW (1992) Optimal design of a two-level hierarchical network with tree-star configuration. Comput Ind Eng 22:273–281

    Article  Google Scholar 

  • Klincewicz JG (1998) Hub location in backbone/tributary network design: a review. Loc Sci 6:307–335

    Article  Google Scholar 

  • Lee CH, Ro HB, Tcha DW (1993) Topological design of a two-level network with ring-star configuration. Comput Oper Res 20(6):625–637

    Article  MATH  Google Scholar 

  • 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–339

    Article  Google Scholar 

  • Lin CC, Chen SH (2004) The hierarchical network design problem for time-definite express common carriers. Transp Res B-Method 38:271–283

    Article  Google Scholar 

  • Mahmutoğulları Aİ, Kara BY (2015) Hub location problem with allowed routing between non hub nodes. Geogr Anal 47:410–430

    Article  Google Scholar 

  • 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–107

  • O’Kelly ME (1986) The location of interacting hub facilities. Transp Sci 20:92–106

    Article  Google Scholar 

  • O’kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404

  • O’Kelly ME, Bryan DL (1998) Hub location with flow economies of scale. Transp Res B Meth 32:605–616

    Article  Google Scholar 

  • O’Kelly ME, Miller HJ (1994) The hub network design problem—a review and synthesis. J Transp Geogr 2:31–40

    Article  Google Scholar 

  • Peker M, Kara BY (2015) The P-hub maximal covering problem and extensions for gradual decay functions. Omega 54:158–172

    Article  Google Scholar 

  • 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–1006

    Google Scholar 

  • Song DP, Carter J (2008) Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Nav Res Log 55:156–171

    Article  MathSciNet  MATH  Google Scholar 

  • 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–105

    Article  MathSciNet  MATH  Google Scholar 

  • Tan PZ, Kara BY (2008) A hub covering model for cargo delivery systems. Networks 49:28–39

    Article  MathSciNet  MATH  Google Scholar 

  • 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–919

    Article  Google Scholar 

  • Yaman H, Karasan OE, Kara BY (2012) Release time scheduling and hub location for next-day delivery. Oper Res 60:906–917

    Article  MathSciNet  MATH  Google Scholar 

  • 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–45

    Google Scholar 

  • 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–89

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Bojnord, Bojnord, Iran

    Hossein Karimi

  2. Faculty of Industrial Engineering, K.N. Toosi University of Technology, No. 7, Pardis St., Mollasadra Ave., Tehran, Iran

    Mostafa Setak

Authors
  1. Hossein Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mostafa Setak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mostafa Setak.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Karimi, H., Setak, M. Flow shipment scheduling in an incomplete hub location-routing network design problem. Comp. Appl. Math. 37, 819–851 (2018). https://doi.org/10.1007/s40314-016-0368-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40314-016-0368-y

Keywords

Mathematics Subject Classification

Search

Navigation