Skip to main content

Advertisement

SpringerLink
Log in

A branch and cut algorithm for the capacitated star–star telecommunication network problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this study, a branch and cut algorithm is generated for a telecommunication network problem with bi-hierarchical star–star design and fixed identical concentrator capacities. The problem aims to find out how many and on which nodes concentrators should be located and how the terminal nodes should be assigned to those concentrators, in order minimize the total of costs associated with location, assignment and routing, subject to capacity and demand. Experiments are carried out to identify the performance of the algorithm for the problem instances with different number of total nodes and different concentrator capacities. The algorithm is also tested with additional valid inequalities and under different branching strategies in order to see their effect on the solution time. Experiments have shown that the considered valid inequalities and branching strategies have significant effect on the solution time.

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.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Alumur, S., Kara, B.Y., Karasan, O.E.: The design of single allocation incomplete hub networks. Transp. Res. Part B 43(10), 936–951 (2009)

    Article  Google Scholar 

  2. Alumur, S.A., Yaman, H., Kara, B.Y.: Hierarchical multimodal hub location problem with time-definite deliveries. Transp. Res. Part E 48(6), 1107–1120 (2012)

    Article  Google Scholar 

  3. Ambrosino, D., Sciomachen, A.: A capacitated hub location problem in freight logistics multimodal networks. Optim. Lett. 10(5), 875–901 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Calik, H., Alumur, S., Kara, B.Y., Karasan, O.E.: A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12), 3088–3096 (2009)

    Article  MATH  Google Scholar 

  5. Nickel, S., Schobel, A., Sonneborn, T.: Hub location problems in urban traffic networks. In: Niittymaki, J., Pursula, M. (eds.) Mathematics Methods and Optimization in Transportation Systems, pp. 1–12. Kluwer, Dordrecht (2001)

    Google Scholar 

  6. O’Kelly, M.E., Miller, H.J.: The hub network design problem: a review and synthesis. J. Transp. Geogr. 2(1), 31–40 (1994)

    Article  MathSciNet  Google Scholar 

  7. Yaman, H.: The hierarchical hub median problem with single assignment. Transp. Res. Part B 43(6), 643–658 (2009)

    Article  Google Scholar 

  8. Yoon, M.G., Current, J.: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J. Oper. Res. Soc. 59(1), 80–89 (2008)

    Article  MATH  Google Scholar 

  9. Helme, M.P., Magnanti, T.L.: Designing satellite communication networks by zero-one quadratic programming. Networks 19, 427–450 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chardaire, P., Lutton, J.L., Sutter, A.: Upper and lower bounds for the two-level simple plant location problem. Ann. Oper. Res. 86, 117–140 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Labbé, M., Yaman, H.: Solving the hub location problem in a star–star network. Technical report, revised version of ISRO/OR Preprint 2003/15, Universite Libre de Bruxelles, Brussels (2004)

  12. Yaman, H.: Star p-hub median problem with modular arc capacities. Comput. Oper. Res. 35(9), 3009–3019 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Yaman, H., Elloumi, S.: Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39(11), 2725–2732 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Yaman, H.: Concentrator Location in Telecommunications Networks. Springer, Berlin (2006)

    MATH  Google Scholar 

  15. Bosco, A., Laganà, D., Musmanno, R., Vocaturo, F.: Modeling and solving the mixed capacitated general routing problem. Optim. Lett. 7(7), 1451–1469 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Labbé, M., Yaman, H., Gourdin, E.: A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2), 371–405 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423–445 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rodríguez-Martín, I., Salazar-González, J.J., Yaman, H.: A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50, 161–174 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Eastern Mediterranean University, Via Mersin 10, Gazimagusa TRNC, Turkey

    Hüseyin Güden

  2. Department of Industrial Engineering, National Defense University, Turkish Naval Academy, Istanbul, Turkey

    Ertan Yakıcı

Authors
  1. Hüseyin Güden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ertan Yakıcı
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ertan Yakıcı.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Güden, H., Yakıcı, E. A branch and cut algorithm for the capacitated star–star telecommunication network problem. Optim Lett 13, 825–836 (2019). https://doi.org/10.1007/s11590-018-1282-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1282-6

Keywords

Search

Navigation