Advertisement

Heuristic Search for Network Design

  • Ioannis Gamvros
  • Bruce Golden
  • S. Raghavan
  • Daliborka Stanojević
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 76)

Abstract

In this chapter, we focus on heuristics for network design problems. Network design problems have many important applications and have been studied in the operations research literature for almost 40 years. Our goal here is to present usefull guidelines for the design of intelligent heuristic search methods for this class of problems. Simple heuristics, local search, simulated annealing, GRASP, tabu search, and genetic algorithms are all discussed. We demonstrate the effective application of heuristic search techniques, and in particular genetic algorithms, to four specific network design problems. In addition, we present a selected annotated bibliography of recent applications of heuristic search to network design.

Keywords

Heuristics Local Search Network Design Genetic Algorithms 

References

  1. [1]
    E. H. L. Aarts, J. H. M. Kost, and P. J. M van Laarhoven. Simulated annealing. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 91–120. Wiley, New York, 1997.Google Scholar
  2. [2]
    R. K. Ahuja, J. B. Orlin, and D. Sharma. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Operations Research Letters, 31:185–194, 2001.MathSciNetCrossRefGoogle Scholar
  3. [3]
    R. K. Ahuja, J. B. Orlin, and D. Sharma. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91:71–97, 2001.MathSciNetzbMATHGoogle Scholar
  4. [4]
    A. Amberg, W. Domschke, and S. Voß. Capacitated minimum spanning trees:Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1:9–40, 1996.Google Scholar
  5. [5]
    J. C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154–160, 1994.zbMATHGoogle Scholar
  6. [6]
    D. Berger, B. Gendron, J. Y. Potvin, S. Raghavan, and P. Soriano. Tabu search for a network loading problem with multiple facilities. Journal of Heuristics, 6(2):253–267, 2000.CrossRefzbMATHGoogle Scholar
  7. [7]
    T. Brüggeman, J. Monnot, and G. J. Woeginger. Local search for the minimum label spanning tree problem with bounded color classes. Operation Research Letters, 31:195–201, 2003.MathSciNetCrossRefGoogle Scholar
  8. [8]
    R. S. Chang and S. J. Leu. The minimum labeling spanning trees. Information Processing Letters, 63(5):277–282, 1997.MathSciNetCrossRefGoogle Scholar
  9. [9]
    G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568–581, 1964.Google Scholar
  10. [10]
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.zbMATHGoogle Scholar
  11. [11]
    C. S. Coulston. Steiner minimal trees in a hexagonally partitioned space. International Journal of Smart Engineering System Design, 5:1–6, 2003.CrossRefGoogle Scholar
  12. [12]
    T. G. Crainic and M. Gendreau. A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing, 12(3):223–236, 2000.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    R. Doverspike and I. Saniee, editors. Heuristic approaches for telecommunications network management, planning and expansion. Journal of Heuristics, 6(1): 1–188, 2000.Google Scholar
  14. [14]
    M. Dror, M. Haouari, and J. Chaouachi. Generalized spanning trees. European Journal of Operational Research, 120:583–592, 2000.MathSciNetCrossRefzbMATHGoogle Scholar
  15. [15]
    D. Du, J. H. Rubenstein, and J. M. Smith, editors. Advances in Steiner Trees. Kluwer Academic Publishers, 2000.Google Scholar
  16. [16]
    C. Duin and S. Voß. The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34(3):181–191, 1999.MathSciNetCrossRefzbMATHGoogle Scholar
  17. [17]
    C. Duin and S. Voß. Solving group Steiner problems as Steiner problems. European Journal of Operational Research, 154:323–329, 2004.MathSciNetCrossRefzbMATHGoogle Scholar
  18. [18]
    L. R. Esau and K. C. Williams. On teleprocessing system design. IBM System Journal, 5:142–147, 1966.CrossRefGoogle Scholar
  19. [19]
    E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5–30, 1996.CrossRefGoogle Scholar
  20. [20]
    C. Feremans. Generalized Spanning Trees and Extensions. PhD thesis, Université Libre de Bruxelles, 2001.Google Scholar
  21. [21]
    P. Festa and M. G. C. Resende. GRASP: An annotated bibliography. In P. Hansen and C. C. Ribeiro, editors, Essays and Surveys on Metaheuristics. Kluwer Academic Publishers, Norwell, MA, 2001.Google Scholar
  22. [22]
    I. Frommer, B. Golden, and G. Pundoor. Heuristic methods for solving Euclidean nonuniform Steiner tree problems. Working paper, Smith School of Business, University of Maryland, 2003.Google Scholar
  23. [23]
    I. Gamvros, B. Golden, and S. Raghavan. The multi-level capacitated minimum spanning tree problem. Working paper, Smith School of Business, University of Maryland, 2003.Google Scholar
  24. [24]
    I. Gamvros, S. Raghavan, and B. Golden. An evolutionary approach to the multi-level capacitated minimum spanning tree problem. In G. Anandalingam and S. Raghavan, editors, Telecommunications Network Design and Management, chapter 6, pages 99–124. Kluwer Academic Publishing, Norwell, MA, 2003.Google Scholar
  25. [25]
    B. Gavish. Topological design of telecommunications networks-local access design methods. Annals of Operations Research, 33:17–71, 1991.zbMATHCrossRefGoogle Scholar
  26. [26]
    B. Gendron, J. Y. Potvin, and P. Soriano. Diversification strategies in local search for a nonbifurcated network loading problem. European Journal of Operational Research, 142:231–241, 2002.MathSciNetCrossRefzbMATHGoogle Scholar
  27. [27]
    F. Glover. Tabu search and adaptive memory programming-advances, applications and challenges. In R. S. Barr, R. V. Helgason, and J. L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1–75. Kluwer, Boston, 1996.Google Scholar
  28. [28]
    F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science. Kluwer Academic Publishers, 2002.Google Scholar
  29. [29]
    F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Norwell, MA, 1997.zbMATHGoogle Scholar
  30. [30]
    B. Golden, S. Raghavan, and D. Stanojević. The prize-collecting generalized minimum spanning tree problem. Working paper, Smith School of Business, University of Maryland, 2004.Google Scholar
  31. [31]
    B. Golden, S. Raghavan, and D. Stanojević. Heuristic search for the generalized minimum spanning tree problem. INFORMS Journal on Computing, to appear.Google Scholar
  32. [32]
    G. R. Harik and F. G. Lobo. A parameter-less genetic algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, pages 258–265, San Francisco, CA, USA, 1999. Morgan Kaufmann.Google Scholar
  33. [33]
    M. Hindsberger and R. V. V. Vidal. Tabu search-a guided tour. Control and Cyberentics, 29(3):631–661, 2000.MathSciNetzbMATHGoogle Scholar
  34. [34]
    A. Kershenbaum. When genetic algorithms work best. INFORMS Journal on Computing, 9(3):254–255, 1997.Google Scholar
  35. [35]
    S. O. Krumke and H. C. Wirth. On the minimum label spanning tree problem. Information Processing Letters, 66(2):81–85, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  36. [36]
    J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proc. American Math. Society, volume 2, pages 48–50, 1956.MathSciNetCrossRefGoogle Scholar
  37. [37]
    M. Laguna and R. Marti. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11:44–52, 1999.CrossRefzbMATHGoogle Scholar
  38. [38]
    Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg, 1996.zbMATHGoogle Scholar
  39. [39]
    C. L. Monma and D. F. Shallcross. Methods for designing communications networks with certain two-connected survivability constraints. Operations Research, 37(4):531–541, 1989.Google Scholar
  40. [40]
    Y. S. Myung, C. H. Lee, and D. W. Tcha. On the generalized minimum spanning tree problem. Networks, 26:231–241, 1995.MathSciNetzbMATHGoogle Scholar
  41. [41]
    C. C. Palmer and A. Kershenbaum. An approach to a problem in network design using genetic algorithms. Networks, 26:151–163, 1995.zbMATHGoogle Scholar
  42. [42]
    J. C. Park and C. G. Han. Solving the survivable network design problem with search space smoothing. in Network Optimization, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, 450, 1997.Google Scholar
  43. [43]
    L. S. Pitsoulis and M. G. C. Resende. Greedy randomized adaptive search procedure. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization, chapter 3, pages 168–183. Oxford University Press, 2002.Google Scholar
  44. [44]
    P. C. Pop. The Generalized Minimum Spanning Tree Problem. PhD thesis, University of Twente, 2002.Google Scholar
  45. [45]
    M. Prais and C. C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3):164–176, 2000.MathSciNetCrossRefzbMATHGoogle Scholar
  46. [46]
    R. C. Prim. Shortest connecting networks and some generalizations. Bell System Tech. J.. 36:1389–1401, 1957.Google Scholar
  47. [47]
    F. Rothlauf, D. E. Goldberg, and A. Heinzl. Network random keys-a tree representation scheme for genetic and evolutionary algorithms. Evolutionary Computation, 10(1):75–97, 2002.CrossRefGoogle Scholar
  48. [48]
    F. Salman, R. Ravi, and J. Hooker. Solving the local access network design problem. Working paper, Krannert Graduate School of Management, Purdue University, 2001.Google Scholar
  49. [49]
    Y. M. Sharaiha, M. Gendreau, G. Laporte, and I. H. Osman. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29:161–171, 1997.MathSciNetCrossRefzbMATHGoogle Scholar
  50. [50]
    S. J. Shyu, P. Y. Yin, B. M. T. Lin, and M. Haouari. Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. Journal of Experimental and Theoretical Artificial Intelligence, 15:103–112, 2003.CrossRefzbMATHGoogle Scholar
  51. [51]
    Y. Wan, G. Chen, and Y. Xu. A note on the minimum label spanning tree. Information Processing Letters, 84:99–101, 2002.MathSciNetCrossRefzbMATHGoogle Scholar
  52. [52]
    Y. Xiong, B. Golden, and E. Wasil. A one-parameter genetic algorithm for the minimum labeling spanning tree problem. Working paper, Smith School of Business, University of Maryland, 2003.Google Scholar
  53. [53]
    Y. Xiong, B. Golden, and E. Wasil. Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Operations Research Letters, to appear.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Ioannis Gamvros
    • 1
  • Bruce Golden
    • 1
  • S. Raghavan
    • 1
  • Daliborka Stanojević
    • 1
  1. 1.The Robert H. Smith School of BusinessUniversity of MarylandUSA

Personalised recommendations