Abstract
We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET channels on fiber optics links and ADM equipment at the nodes. We specifically take into account the economies of scale provided by the transmission systems and the transmission hierarchy of SONET systems.
We describe in detail the parameters used for defining neighborhoods, penalty parameters, data structure and indicate how this can lead to substantial improvements of the overall computational time while providing costs lower than those of a more straightforward method. Results are provided for a set of random cases as well as for a real network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Altinkemer and H. Pirkul, Heuristics with constant error guarantees for the multi center capacitated minimum spanning tree problem, Journal of Information and Optimization Sciences 13(1) (1992) 49–71.
S. Chamberland and B. Sansò, On the design of multi–technology networks, To appear in INFORMS Journal on Computing.
S. Chamberland and B. Sansò, Tabu search and post–optimization algorithms for the topological update of two–level networks with modular switches, Technical Report G97–71, GERAD, 2920, Chemin de la Tour 4e étage, bureau 4482, Montréal (Québec), Canada H3T 1J4 (1997).
S. Chamberland, B. Sansò and O. Marcotte, Topological design of two–level telecommunication networks with modular switches, Operations Research 48(4) (2000) 745–760.
F. Chy, Recherche de la structure optimale d'un réseau d'accès avec raccordement des usagers en arbre', Technical Report G–2001–07, GERAD, 5255 Ave. Decelles, Montréal, Québec, Canada H3T 1V6 (1999).
M. El–Hafa, A. Girard and B. Sansò, Design of core and edge broadband networks with tree access topology, in: Optimization Days (1999).
L. Esau and K. Williams, On teleprocessing system design, IBM System Journal 5 (1966) 142–147.
B. Gavish, Topological design of centralized computer networks–formulations and algorithms, Networks 12 (1982) 355–377.
B. Gavish, Topological design of telecommunication networks–local access design methods, Annals of Operations Research 33 (1991) 17–71.
F. Glover, Tabu search–part I, ORSA Journal on Computing 1(3) (1989) 190–206.
F.W. Glover and M. Laguna, Tabu Search (Kluwer Academic, 1998).
M. Goldstein and B. Rothfarb, The one–terminal telpack problem, Operations Research 19 (1971) 156–169.
L. Gouveia, A 2n constraint formulation for the capacitated minimal spanning tree problem, Operations Research 43(1) (1995) 130–41.
L. Gouveia and M.J. Lopes, Using generalized capacitated trees for designing the topology of local access networks, Telecommunication Systems 7 (1997) 315–337.
A. Kershenbaum, Computing capacitated minimal spanning trees efficiently, Networks 4 (1974) 299–310.
J.G. Klincewicz, Hub location in backbone/tributary network design: A review, Location Science 6 (1998) 307–335.
J. Kruskal, On the shortest spanning subree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7 (1956) 48–50.
C. Lee, An algorithm for the design of multitype concentrator networks, Journal of the Operational Research Society 44(5) (1993) 471–482.
G.R. Mateus and R.V.L. Franqueira, Model and heuristic for a generalized access network design problem, Telecommunication Systems 15 (2000) 257–271.
P. McGregor and D. Shen, Network design: An algorithm for the access facility location problem, IEEE Transactions on Communications COM–25(1) (1977) 61–73.
R.A. Patterson, E. Rolland and H. Pirkul, A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem, Journal of Heuristics 5(2) (1999) 159–180.
H. Pirkul and R. Gupta, Topological design of centralized computer networks, International Transactions in Operational Research 4(1) (1997) 75–83.
H. Pirkul and V. Nagarajan, Locating concentrators in centralized computer networks, Annals of Operations Research 36(1–4) (1992) 247–61.
H. Pirkul and S. Narasimhan, Hierarchical concentrator location problem, Computer Communications 15(3) (1992) 185–91.
R. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957) 1389–1401.
G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Computer Networks 6 (1982) 1–11.
Y.M. Sharaiha, M. Gendreau, G. Laporte and I.H. Osman, A tabu search algorithm for the capacitated shortest spanning tree problem, Networks 29(3) (1997) 161–171.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Girard, A., Sansò, B. & Dadjo, L. A Tabu Search Algorithm for Access Network Design. Annals of Operations Research 106, 229–262 (2001). https://doi.org/10.1023/A:1014517910427
Issue Date:
DOI: https://doi.org/10.1023/A:1014517910427