Tabu-search and post-optimization algorithms for the update of telecommunication networks

Canadian Journal of Electrical and Computer Engineering

Volumn 27, Issue 2, 2002, Pages 67-74

  Chamberland, Steven ^a   Sansò, Brunilde ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; HEURISTIC METHODS; INTEGER PROGRAMMING; NETWORK PROTOCOLS; ROUTERS; SWITCHES; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

TABU-SEARCH;

TELECOMMUNICATION NETWORKS;

EID: 0036555788     PISSN: 08408688     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. S. Chamberland, B. Sansò, O. Marcotte, "Topological design of two-level telecommunication networks with modular switches," Operations Research, vol. 48, no. 5, Sept./Oct., 2000, pp. 745-760.
2. S. Chamberland and B. Sansò, "Topological expansion of metropolitan area networks," Networks, vol. 36, no. 4, Dec. 2000, pp. 210-224.
3. F. Glover and M. Laguna, Tabu Search, Boston, Mass.: Kluwer Academic Publishers, 1997.
4. R. Jonker and T. Volgenant, "A shortest augmenting path algorithm for dense and sparse linear assignment problems," Computing, vol. 38, no. 4, June 1987, pp. 325-340.
5. J. Kennington and Z. Wang, "An empirical analysis of the dense assignment problem: Sequential and parallel implementations," ORSA J. Computing, vol. 4, no. 4, Fall 1991, pp. 299-306.
6. E. Balas, "The prize collecting traveling salesman problem," presented at ORSA/TIMS Spring Meeting, Los Angeles, Calif., 1986.
7. _, "The prize collecting traveling salesman problem," Networks, vol. 19, no. 6, Oct. 1989, pp. 621-636.
8. _, "The prize collecting traveling salesman problem: II. Polyhedral results," Networks, vol. 25, no. 4, July 1995, pp. 199-216.
9. M. Fischetti and P. Toth, "An additive approach for the optimal solution of the prize-collecting travelling salesman problem," in Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad, New York: North-Holland, 1988, pp. 319-343.
10. M. Gendreau, M. Labbé, and G. Laporte, "Efficient heuristics for the design of ring networks," Telecomm. Syst., vol. 4, no. 3/4, Sept. 1995, pp. 177-188.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, New York: Wiley, 1985.
12. M. Gendreau, A. Hertz, and G. Laporte, "New insertion and post-optimization procedures for the traveling salesman problem," Operations Research, vol. 40, no. 6, Nov./Dec. 1992, pp. 1086-1094.
13. ILOG Inc., "Using the CPLEX callable library and CPLEX mixed integer library," ILOG Inc., Incline Village, Ney., 2000.