Skip to main content

Advertisement

Log in

Heuristics for multi-period capacity expansion in local telecommunications networks

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper, different heuristics are devised to solve a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. This expansion is done by installing concentrators at the nodes and cables on the links of the network. The goal is to find a least cost capacity expansion strategy over a number of periods to satisfy the demand. A local search heuristic is first proposed to improve previously reported results on problem instances based on different cost and demand structures. This heuristic is then integrated into a genetic algorithm to obtain further improvements.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 101–111. Erlbaum, Hillsdale (1985)

    Google Scholar 

  • Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the Second International Conference on Genetic Algorithms and their Applications, pp. 14–21. Erlbaum, Hilldale (1987)

    Google Scholar 

  • Balakrishnan, A., Magnanti, T.L., Shulman, A., Wong, R.T.: Models for planning capacity expansion in local access telecommunications network. Ann. Oper. Res. 33, 239–284 (1991)

    Article  MATH  Google Scholar 

  • Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A decomposition algorithm for local access telecommunications network expansion planning. Oper. Res. 43, 58–76 (1995)

    Article  MATH  Google Scholar 

  • Chang, S.-G., Gavish, B.: Telecommunications network topological design and capacity expansion: formulation and algorithms. Telecommun. Syst. 1, 99–131 (1993)

    Article  Google Scholar 

  • Chang, S.-G., Gavish, B.: Lower bounding procedures for multiperiod telecommunications network expansion problems. Oper. Res. 43, 43–57 (1995)

    Article  MATH  Google Scholar 

  • Chardaire, P.: Hierarchical two level location problems. In: Sanso, B., Soriano, P. (eds.) Telecommun. Netw. Plan., pp. 33–54. Kluwer Academic, Dordrecht (1999)

    Google Scholar 

  • Chen, M., Alfa, A.S.: A model for planning multi-period local access communication network, Working Paper, University of Regina (1996)

  • Christofides, N., Brooker, P.: Optimal expansion of an existing network. Math. Program. 6, 197–211 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  • Doulliez, P., Rao, R.: Optimal network capacity planning: a shortest path scheme. Oper. Res. 23, 811–818 (1975)

    Article  Google Scholar 

  • Dutta, A., Lim, J.-I.: A multiperiod capacity planning model for backbone computer communication networks. Oper. Res. 40, 689–705 (1992)

    Article  MATH  Google Scholar 

  • Flippo, O.E., Kolen, A.W.J., Koster, A.M.C.A., van de Leensel, R.L.M.J.: A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur. J. Oper. Res. 127, 189–202 (2000)

    Article  MATH  Google Scholar 

  • Gendreau, M., Potvin, J.-Y., Smires, A., Soriano, P.: Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172, 1051–1066 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Gouveia, L., Lopes, M.J.: Using generalized capacitated trees for designing the topology of local access networks. Telecommun. Syst. 7, 315–337 (1997)

    Article  Google Scholar 

  • Gouveia, L., Paixâo, J.: Dynamic programming based heuristics for the topological design of local access networks. Ann. Oper. Res. 33, 305–327 (1991)

    Article  MATH  Google Scholar 

  • Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  • Mateus, G.R., Franqueira, R.V.L.: Model and heuristic for a generalized access network design problem. Telecommun. Syst. 15, 257–271 (2000)

    Article  MATH  Google Scholar 

  • Parrish, S., Cox, T., Kuehner, W., Qiu, Y.: Planning for optimal expansion of leased line communications networks. Ann. Oper. Res. 36, 347–364 (1992)

    Article  MATH  Google Scholar 

  • Zadeh, N.: On building minimum cost communication networks over time. Networks 4, 19–34 (1974)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Yves Potvin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kouassi, R., Gendreau, M., Potvin, JY. et al. Heuristics for multi-period capacity expansion in local telecommunications networks. J Heuristics 15, 381–402 (2009). https://doi.org/10.1007/s10732-007-9067-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9067-6

Keywords

Navigation