Using simulated annealing to minimize the cost of centralized telecommunications networks

INFOR Journal

Volumn 37 (O), Issue 3, 1999, Pages 271-296

  Bourjolly, Jean Marie ^a   Tomiuk, Daniel ^a   Kapantow, Gene H M ^a,b,c,d  

^a Dept of Electrical and Computer Engineering   (Canada)

^b UNIVERSITY OF QUEENSLAND   (Australia)

^c Department of Decision Sciences ^*

^d UNIVERSITY OF INDONESIA   (Indonesia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; ELECTRIC NETWORK TOPOLOGY; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

ASSIGNMENT; CAPACITATED MINIMUM SPANNING TREE; CENTRALIZED TELECOMMUNICATION NETWORKS; VEHICLE ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 12944311036     PISSN: 03155986     EISSN: None     Source Type: None    
DOI: 10.1080/03155986.1999.11732385     Document Type: Article

References (31)

1. Amberg, A., Domschke, W. and Darmstadt, S.V. (1996): 'Capacitated Minimum Spanning Trees: Algorithms Using Intelligent Search', Combinatorial Optimization: Theory and Practice, 1, pp. 9-40.
2. Abuali, F. N., Schoenefeld, D. A. and Wainwright, R. L. (1994): 'Terminal Assignment in a Communications Network Using Genetic Algorithms', Proceedings of 22nd ACM Computer Science Conference, Phoenix, Arizona, pp. 74-81
3. Balakrishnan, A., Magnanti, T. L., Shulman, A., and Wong, R. T (1991): "Models for Capacity Expansion in Local Access Telecommmnication Networks", Annals of Operations Research, 33, pp. 239 - 284.
4. Breedam, A.V. (1995): 'Improvement Heuristics for the Vehicle Routing Problem Based on Simulated Annealing', European Journal of Operational Research, 86, pp. 480- 490.
5. Bohachevsky, I.O., Johnson, M.E. and Stein, M.L: 'Generalized Simulated Annealing for Function Optimization', Technometrics, 28, 1986, pp. 209-217.
6. Boorstyn, R.R., and Frank, H.(1977): 'Large Scale Network Topological Optimization', IEEE Transactions on Communications, Com-25, pp. 29- 47.
7. Cerny, V (1985): 'Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm', Journal of Optimization Theory and Applications, 45, pp. 41-51.
8. Chardaire, P., and Lutton, J. L. (1993): "Using Simulated Annealing to Solve Concentrator Location Problems in Telecommunication Networks". In R.V.V. Vidai (Ed.), Applied Simulated Annealing, Springer-Verlag, Berlin, pp. 175-199.
9. Christofides, N., Mingozzi, A., and Toth P. (1979): 'The Vehicle Routing Problem'. In N. Christofides, A. Magozzi, P. Toth, and C. Sandi (eds.), Combinatorial Optimization, Wiley, pp. 315-338.
10. Clarke, G. and Wright, J. (1964): 'Scheduling for Vehicles from a Central Depot to a Number of Delivery Points', Operations Research, 12, pp. 568- 581.
11. Daskin, M. S. (1995): Network and Discrete Location: Models, Algorithms and Applications, Wiley.
12. Eglese, R. W (1990): 'Simulated Annealing: A Tool for Operational Research', European Journal of Operational Research, 46, pp. 271-281.
13. Esau, L. R., and Williams, K. C. (1966): On Teleprocessing System Design', Part II, IBM System Journal, 5, no. 3, pp. 142-147.
14. Garey, M. R., and Johnson, D. S. (1979): Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, San Fransisco.
15. Gavish, B. (1991): 'Topological Design of Telecommunication Networks - Local Access Design Methods', Annals of Operations Research, 33, pp. 17 - 71.
16. Gendreau, M., Hertz, A., and Laporte, G. (1994): "A Tabu Search Heuristic for the Vehicle Routing Problem", Management Science, 40, pp. 1276 - 1290.
17. Gouveia, L., and Lopes, M. J. (1997): 'Using Generalized Capacitated Trees for Designing the Topology of Local Access Networks', Telecommunication Systems, 7, pp. 315-337.
18. Kapantow, Gene H.M. (1996): "Solving Concentrator and Terminal Assignment Problems Using Simulated Annealing" M.Sc.A. Thesis, Concordia University, Montreal, Canada.
19. Karnaugh, M. (1976): 'A new Class of Multipoint Network Optimization.', IEEE Transactions on Communications, 24, pp. 500-505.
20. Kershenbaum, A., Boorstyn, R. and Oppenheim, R. (1980): 'Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design', IEEE Transactions on Communications, 28, pp. 1835-1838..
21. Kershenbaum, A. (1993): Telecommunications Network Design Algorithms, McGraw-Hill, NY.
22. Kirkpatrick, S., Gelatt, Jr., C. D., and Vecchi, M. P. (1983): Optimization by Simulated Annealing', Science, 220, pp. 671-680.
23. Krarup, J., and Pruzan, M. (1990): 'Ingredients of Location Analysis'. In RB. Mirchandani and R. L. Francis (eds.), Discrete Location Theory, Wiley, pp. 1-54.
24. Laporte, G., and Nobert, Y. (1987): 'Exact Algorithms for the Vehicle Routing Problem'. In Annals of Discrete Mathematics, 31, 'Surveys in Combinatorial Optimization', edited by S. Martello, G. Laporte, M. Minoux, and C. Ribeiro, pp. 147-184.
25. Mirchandani, P., and Francis, R.L., eds. (1990): Discrete Location Theory, Wiley.
26. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M. N., and Teller, A. H. (1953): 'Equation of State Calculations by Fast Computing Machines', Journal of Chemical Physics, 21, no. 6, pp.1087- 1092.
27. Mirzaian, A., and Steiglitz, K. (1981): 'A Note on the Complexity of the Star-Star Concentrator Problem', IEEE Transactions on Communications, COM-29, pp. 1549-1552.
28. Papadimitriou, C. H. (1978): 'The Complexity of the Capacitated Tree Problem', Networks, 8, pp. 217- 230.
29. Sharaiha, Y. M., Gendreau, M., Laporte, G., and Osman, I. H. (1997): 'A Tabu Search Algorithm for the Capacitated Minimum Spanning Tree Problem', Networks, 29, pp. 161-171
30. Taillard, E. (1992): "Parallel Iterative Search Methods for Vehicle Routing Problems', Working Paper ORWP 92/03, Département de Mathématiques. Ecole Polytechnique Fédérale de Lausanne, Switzerland.
31. Tomiuk, Daniel B. (1996): "Using Simulated Annealing to Minimize the Cost of Multipoint Lines in Centralized Computer Networks. Implementation in WINDOWS3.1™", MScA. Thesis, Concordia University, Montreal, Canada.