access icon free Hierarchical hub location problem for freight network design

© The Institution of Engineering and Technology
Received 29/01/2018, Accepted 07/06/2018, Revised 30/05/2018, Published 26/07/2018

In order to minimise the total cost of the logistics part of the network design, it is necessary to use the hub-and-spoke network structure to achieve economies of scale in transportation. Most of the models used to design hub networks have considered a single level of hub type, but they do not reflect the hub scale by freight volume in the network. The aim of this study was to design a hub-and-spoke network with hierarchical hubs and develop a model for the evaluation of logistics systems. The developed model determined the number of each level of hubs to be opened, identified the locations of these hubs, and allocated the demand nodes to the hubs. In this study, the development of algorithms for solving problems was also investigated. This model provides new insights and approaches into these research areas. The proposed algorithm contributes to the more generalised field of combinatorial optimisation problems, particularly for the problems associated with the design of a hierarchical hub network.

Inspec keywords: minimisation; freight handling; facility location; economies of scale; combinatorial mathematics

Other keywords: demand nodes; economies-of-scale; freight volume; combinatorial optimisation problems; hierarchical hub network; hub type; transportation; hierarchical hub location problem; freight network design; hub-and-spoke network structure; total cost minimisation

Subjects: Combinatorial mathematics; Combinatorial mathematics; Production management; Systems theory applications in industry; Economics; Systems theory applications; Systems theory applications in economics and business; Optimisation; Optimisation techniques; Goods distribution

References

    1. 1)
      • 9. Guldmann, J.-M., Shen, G.: ‘A general mixed integer nonlinear optimization model for hub network design’. 44th North American meeting of the Regional Science Association Int., Buffalo, NY, USA, 1997.
    2. 2)
      • 1. Gelareh, S., Nickel, S., Pisinger, D.: ‘Liner shipping hub network design in a competitive environment’, Transp. Res. E Logist. Transp. Rev., 2010, 46, (6), pp. 991–1004.
    3. 3)
      • 19. Ebery, J., Krishnamoorthy, M., Ernst, A., et al: ‘The capacitated multiple allocation hub location problem: formulations and algorithms’, Eur. J. Oper. Res., 2000, 120, (3), pp. 614–631.
    4. 4)
      • 12. Horner, M.W., O'Kelly, M.E.: ‘Embedding economies of scale concepts for hub network design’, J. Transp. Geogr., 2001, 9, (4), pp. 255–265.
    5. 5)
      • 2. Abdinnour-Helm, S., Venkataramanan, M.A.: ‘Solution approaches to hub location problems’, Ann. Oper. Res., 1998, 78, pp. 31–50.
    6. 6)
      • 8. Aykin, T., Gursoy, K.: ‘Hub and spoke system design with concave costs’. INFORMS National Meeting, Atlanta, GA, 1996.
    7. 7)
      • 22. Lee, H.S., Shin, K.S., Kim, Y.K.: ‘A design of capacitated hub-and-spoke networks with direct shipment: evolutionary algorithm based approach’, J. Korean Inst. Ind. Eng., 2005, 31, (4), pp. 303–315.
    8. 8)
      • 14. Kim, D.-K., Park, C.H., Kim, T.J.: ‘Single allocation hub network design model with consolidated traffic flows’, Transp. Res. Rec., 2007, 2008, pp. 51–59.
    9. 9)
      • 23. Yaman, H.: ‘The hierarchical hub median problem with single assignment’, Transp. Res. B Methodol., 2009, 43, (6), pp. 643–658.
    10. 10)
      • 11. O'Kelly, M.E., Bryan, D.: ‘Hub location with flow economies of scale’, Transp. Res. B Methodol., 1998, 32, (8), pp. 605–616.
    11. 11)
      • 3. Boland, N., Krishnamoorthy, M., Ernst, A.T., et al: ‘Preprocessing and cutting for multiple allocation hub location problems’, Eur. J. Oper. Res., 2004, 155, (3), pp. 638–653.
    12. 12)
      • 13. Racunica, I., Wynter, L.: ‘Optimal location of intermodal freight hubs’, Transp. Res. B Methodol., 2005, 39, (5), pp. 453–477.
    13. 13)
      • 16. Skorin-Kapov, D., Skorin-Kapov, J., O'Kelly, M.: ‘Tight linear programming relaxations of uncapacitated P-hub median problems’, Eur. J. Oper. Res., 1996, 94, (3), pp. 582–593.
    14. 14)
      • 21. Elhedhli, S., Hu, F.X.: ‘Hub-and-spoke network design with congestion’, Comput. Oper. Res., 2005, 32, (6), pp. 1615–1632.
    15. 15)
      • 6. Antoniou, A.: ‘Economies of scale in the airline industry: the evidence revisited’, Logist. Transp. Rev., 1991, 27, (2), pp. 159–184.
    16. 16)
      • 7. Aykin, T.: ‘Lagrangian-relaxation based approaches to capacitated hub-and-spoke network design problem’, Eur. J. Oper. Res., 1994, 79, (3), pp. 501–523.
    17. 17)
      • 20. Aykin, T.: ‘Networking policies for hub-and-spoke systems with application to the air transportation system’, Transp. Sci., 1995, 29, (3), pp. 201–221.
    18. 18)
      • 15. Campbell, J.F.: ‘Integer programming formulations of discrete hub location problems’, Eur. J. Oper. Res., 1994, 72, (2), pp. 387–405.
    19. 19)
      • 10. Bryan, D.: ‘Extensions to the hub location problem: formulations and numerical examples’, Geogr. Anal., 1998, 30, (4), pp. 315–330.
    20. 20)
      • 5. O'Kelly, M.E.: ‘A quadratic integer-program for the location of interacting hub facilities’, Eur. J. Oper. Res., 1987, 32, (3), pp. 393–404.
    21. 21)
      • 17. Ernst, A.T., Krishnamoorthy, M.: ‘Efficient algorithms for the uncapacitated single allocation P-hub median problem’, Locat. Sci., 1996, 4, (3), pp. 139–154.
    22. 22)
      • 4. Topcuoglu, H., Corut, F., Ermis, M., et al: ‘Solving the uncapacitated hub location problem using genetic algorithms’, Comput. Oper. Res., 2005, 32, (4), pp. 967–984.
    23. 23)
      • 18. Sohn, J., Park, S.: ‘Efficient solution procedure and reduced size formulations for P-hub location problems’, Eur. J. Oper. Res., 1998, 108, (1), pp. 118–126.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2018.5289
Loading

Related content

content/journals/10.1049/iet-its.2018.5289
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading