Heuristics for multi-period capacity expansion in local telecommunications networks

Journal of Heuristics

Volumn 15, Issue 4, 2009, Pages 381-402

  Kouassi, Roxane ^a,b   Gendreau, Michel ^a,b   Potvin, Jean Yves ^a,b   Soriano, Patrick ^a,c  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c HEC MONTRÉAL   (Canada)

Author keywords

Capacity expansion; Genetic algorithm; Local access network; Local search; Multi period; Telecommunications

Indexed keywords

CAPACITY EXPANSION; CAPACITY EXPANSION STRATEGIES; DEMAND STRUCTURES; LEAST COST; LOCAL ACCESS NETWORK; LOCAL SEARCH; LOCAL SEARCH HEURISTIC; MULTI-PERIOD; PROBLEM INSTANCES; TREE TOPOLOGY;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; TELECOMMUNICATION;

EXPANSION;

EID: 67651049751     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9067-6     Document Type: Article

References (19)

1. 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)
2. 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)
3. A. Balakrishnan T.L. Magnanti A. Shulman R.T. Wong 1991 Models for planning capacity expansion in local access telecommunications network Ann. Oper. Res. 33 239 284
4. A. Balakrishnan T.L. Magnanti R.T. Wong 1995 A decomposition algorithm for local access telecommunications network expansion planning Oper. Res. 43 58 76
5. S.-G. Chang B. Gavish 1993 Telecommunications network topological design and capacity expansion: formulation and algorithms Telecommun. Syst. 1 99 131
6. S.-G. Chang B. Gavish 1995 Lower bounding procedures for multiperiod telecommunications network expansion problems Oper. Res. 43 43 57
7. Chardaire, P.: Hierarchical two level location problems. In: Sanso, B., Soriano, P. (eds.) Telecommun. Netw. Plan., pp. 33-54. Kluwer Academic, Dordrecht (1999)
8. Chen, M., Alfa, A.S.: A model for planning multi-period local access communication network, Working Paper, University of Regina (1996)
9. N. Christofides P. Brooker 1974 Optimal expansion of an existing network Math. Program. 6 197 211
10. P. Doulliez R. Rao 1975 Optimal network capacity planning: a shortest path scheme Oper. Res. 23 811 818
11. A. Dutta J.-I. Lim 1992 A multiperiod capacity planning model for backbone computer communication networks Oper. Res. 40 689 705 (Pubitemid 23581871)
12. O.E. Flippo A.W.J. Kolen A.M.C.A. Koster R.L.M.J. van de Leensel 2000 A dynamic programming algorithm for the local access telecommunication network expansion problem Eur. J. Oper. Res. 127 189 202
13. M. Gendreau J.-Y. Potvin A. Smires P. Soriano 2006 Multi-period capacity expansion for a local access telecommunications network Eur. J. Oper. Res. 172 1051 1066
14. L. Gouveia M.J. Lopes 1997 Using generalized capacitated trees for designing the topology of local access networks Telecommun. Syst. 7 315 337 (Pubitemid 127718448)
15. L. Gouveia J. Paixâo 1991 Dynamic programming based heuristics for the topological design of local access networks Ann. Oper. Res. 33 305 327
16. Koza, J.: Genetic Programming. MIT Press, Cambridge (1992)
17. G.R. Mateus R.V.L. Franqueira 2000 Model and heuristic for a generalized access network design problem Telecommun. Syst. 15 257 271
18. S. Parrish T. Cox W. Kuehner Y. Qiu 1992 Planning for optimal expansion of leased line communications networks Ann. Oper. Res. 36 347 364
19. N. Zadeh 1974 On building minimum cost communication networks over time Networks 4 19 34