Abstract
Ring network design problems have many important applications, especially in the field of telecommunications and vehicle routing. Those problems generally consist of constructing a ring network by selecting a node subset and corresponding direct links. Different requirements and objectives lead to various specific types of NP-hard ring network design problems reported in the literature, each with its own algorithms. We exploit the similarities in problems to produce a more general problem formulation and associated solution methods that apply to a broad range of problems. Computational results are reported for an implementation using a meta-heuristics framework with generic components for heuristic search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amberg, A., W. Domschke, and S. Voß (1996) “Capacitated minimum spanning trees: Algorithms using intelligent search,” Combinatorial Optimization: Theory and Practice, vol. 1, pp. 9–39.
Balas, E. (1989) “The prize collecting traveling salesman problem,” Networks, vol. 19, pp. 621–636.
Battiti, R. (1996) “Reactive search: Toward self-tuning heuristics,” in V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, “Modern Heuristic Search Methods,” Wiley, Chichester, pp. 61–83.
Chao, I.-M., B.L. Golden, and E.A. Wasil (1996) “A fast and effective heuristic for th orienteering problem,” European Journal of Operational Research, vol. 88, pp. 475–489.
Cornuejols, G., J. Fonlupt, and D. Naddef (1985) “The traveling salesman problem on a graph and some related integer polyhedra,” Mathematical Programming, vol. 33, pp. 1–27.
Culberson, J.C. (1998) “On the futility of blind search: An algorithmic view of ‘no free lunch’,” Evolutionary Computation, vol. 6, pp. 109–127.
Dowsland, K.A. (1993) “Simulated annealing,” in C. Reeves, editor, “Modern Heuristic Techniques for Combinatorial Problems,” Halsted, Blackwell, pp. 20–69.
Duin, C. and S. Voß (1999) “The pilot method,” Networks, to appear.
Fink, A., G. Schneidereit, and S. Voß (1998) “Ring network design for metropolitan area networks,” Technical Report, Technical University of Braunschweig, 1998.
Fink, A. and S. Voß (1999) “Generic metaheuristics application to industrial engineering problems,” Computers & Industrial Engineering, to appear.
Fink, A., S. Voß, and D.L. Woodruff (1999) “An adoption path for intelligent heuristic search componentware,” in E. Rolland and N.S. Umanath, editors, Proceedings of the 4th INFORMS Conference on Information Systems and Technology, INFORMS, Linthicum, pp. 153–168.
Fischetti, M., J.J. Salazar González, and P. Toth (1998) “Solving the orienteering problem through branch-and-cut,” INFORMS Journal on Computing, vol. 10, pp. 133–148.
Gendreau, M., M. Labbé, and G. Laporte (1995) “Efficient heuristics for the design of ring networks,” Telecommunication Systems, vol. 4, pp. 177–188.
Glover, F. and M. Laguna (1997) “Tabu Search,” Kluwer, Boston.
Gouveia, L. and J.M. Pires (1998) “Models for a Steiner ring network design problem with revenues,” Technical Report, Faculdade de Ciencias da Universidade de Lisboa.
Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon (1989) “Optimization by simulated annealing: an experimental evaluation; part i, graph partitioning,” Operations Research, vol. 37, pp. 865–892.
Kirkpatrick, S., C.D. Gelatt Jr., and M.P. Vecchi (1983) “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680.
Klincewicz, J.G. (1998) “Hub location in backbone/tributary network design: a review,” Location Science, vol. 6, pp. 307–335.
Laguna, M. (1994) “Clustering for the design of SONET rings in interoffice telecommunications,” Management Science, vol. 40, pp. 1533–1541.
Laporte, G., A. Asef-Vaziri, and C. Sriskandarajah (1996) “Some applications of the generalized traveling salesman problem,” Journal of the Operational Research Society, vol. 47, pp. 1461–1467.
Laporte, G. and S. Martello (1990) “The selective traveling salesman problem,” Discrete Applied Mathematics, vol. 26, pp. 193–207.
Laporte, G. and Y. Nobert (1983) “Finding the shortest cycle through k specified nodes,” Congressus Numerantium, vol. 48, pp. 155–167.
Le Blanc, L.J. and S. Narasimhan (1994) “Topological design of metropolitan area networks,” Computer Networks and ISDN Systems, vol. 26, pp. 1235–1248.
Magnanti, T.L. and R.T. Wong (1984) “Network design and transportation planning: Models and algorithms,” Transportation Science, vol. 18, pp. 1–55.
Miller, C.E., A.W. Tucker, and R.A. Zemlin (1960) “Integer programming formulation of traveling salesman problems,” Journal of the Association of Computing Machinery, vol. 7, pp. 326–329.
Mocci, U. and L. Primicerio (1997) “Ring network design: An MCDM approach,” in G. Fandel and T. Gal, editors, “Multiple Criteria Decision Making,” Springer, Berlin Heidelberg, pp 491–500.
Morreale, P.A. and G.M. Campbell (1990) “Metropolitan-area networks,” IEEE Spectrum, vol. 27, no. 5, pp. 40–42.
Ratliff, D.M. and A.S. Rosenthal (1983) “Order picking in a rectangular warehouse: a solvable case of the travelling salesman problem,” Operations Research, vol. 31, pp. 507–521.
Reinelt, G. (1991) “TSPLIB — A traveling salesman problem library,” ORSA Journal on Computing, vol. 3, pp. 376–384.
Voß, S. (1996) “Dynamic tabu search strategies for the traveling purchaser problem,” Annals of Operations Research, vol. 63, pp. 253–275.
Wolpert, D.H. and W.G. Macready (1997) “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, pp. 67–82.
Woodruff, D.L. and E. Zemel (1993) “Hashing vectors for tabu search,” Annals of Operations Research, vol. 41, pp. 123–138.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fink, A., Schneidereit, G., Voß, S. (2000). Solving General Ring Network Design Problems by Meta-Heuristics. In: Laguna, M., Velarde, J.L.G. (eds) Computing Tools for Modeling, Optimization and Simulation. Operations Research/Computer Science Interfaces Series, vol 12. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4567-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4567-5_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7062-8
Online ISBN: 978-1-4615-4567-5
eBook Packages: Springer Book Archive