A First Level Scatter Search Implementation for Solving the Steiner Ring Problem in Telecommunications Network Design

  • Jie Feng Xu
  • Steve Chiu
  • Fred Glover
Part of the Combinatorial Optimization book series (COOP, volume 11)


In this paper, we consider a combinatorial optimization problem in a graph G(V, E) where V represents the node set and E denotes the edge set. V is partitioned into two subsets V 1 and V 2, which denote the “Steiner” node set and “Target” node set respectively. Similarly, E is partitioned into sets of E 1 and E 2, where E 1 is the set of edges that join two Steiner nodes, and E 2 is the set of edges that join one Steiner node and one target node. No edges exist between two target nodes. The problem is to select a non-empty Steiner set SV 1 such that each target node must be linked to exactly one selected Steiner node. Meanwhile, all selected (active) Steiner nodes must be connected to form a Hamiltonian tour of minimum connection cost which is called Traveling Salesman (TSP) tour. The objective of the problem is to minimize the total costs (which we will describe in detail subsequently).


Tabu Search Target Node Vehicle Route Problem Scatter Search Path Relinking 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Chopra and M. R. Rao, On the Steiner Tree Problem I & II, Mathematical Programming, 64 (1994), pp. 209–246.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    C. Duin, and S. Voβ, Steiner Tree Heuristics - A Survey, i n: Operations Research Proceedings 1993, Papers of the 22nd Annual Meeting of DG OR in Cooperation with NSOR,pp. 485–496, (Springer-Verlag, 1994).Google Scholar
  3. [3]
    F. Glover, Parametric Combinations of Local Job Shop Rules, Chapter IV,ONR Research Memorandum no. 117, GSIA, (Carnegie Mellon University, Pittsburgh, PA,963).Google Scholar
  4. [4]
    F. Glover, A Multiphase Dual Algorithm for the Zero-One Integer Programming Problem, Operations Research, 13, 6 (1965), pp. 879.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    F. Glover, Heuristics for Integer Programming Using Surrogate Constraints, Decision Sciences, 8 (1977), pp. 156–166.CrossRefGoogle Scholar
  6. [6]
    F. Glover, Tabu Search - Part I, ORSA Journal of Computing, 3 (1989), pp. 190–206.MathSciNetGoogle Scholar
  7. [7]
    F. Glover, Tabu Search and Adaptive Memory Programming - Advances, Applications and Challenges, in: Interfaces in Computer Science and Operations Research, Barr, Helgason and Kennington, eds., (Kluwer Academic Publishers, 1996), pp. 1–75.Google Scholar
  8. [8]
    F. Glover, Scatter Search and Path Relinking, in: New Methods in Optimization, D. Corne, M. Dorigo and F. Glover (Eds.), (McGraw-Hill, 1999).Google Scholar
  9. [9]
    F. Glover and M. Laguna Tabu Search, (Kluwer Academic Publishers, 1997)MATHCrossRefGoogle Scholar
  10. [10]
    F. Glover and C. McMillan, The General Employee Scheduling Problem: An Integration of Management Science and Artificial Intelligence, Computers and Operations Research, Vol. 15, No. 5 (1986), pp. 563–593.CrossRefGoogle Scholar
  11. [11]
    H. J. Greenberg and W.P. Pierskalla, Surrogate Mathematical Programs, Operations Research, 18 (1970), pp. 924–939.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    Y. Lee, L. Lu, Y. Qiu and F. Glover, Strong Formulations and Cutting Planes for Designing Digital Data Service Networks, Telecommunication Systems, 2 (1994), pp. 261–274.CrossRefGoogle Scholar
  13. [13]
    Y. Lee, S.Y. Chiu and J. Ryan, A Branch and Cut Algorithm for a Steiner Tree-Star Problem, INFORMS Journal on Computing, Vol. 8, No. 3 (1996), pp. 194–201.MATHCrossRefGoogle Scholar
  14. [14]
    Y. Lee, S.Y. Chiu and J. Ryan, A Branch and Cut Algorithm for a Steiner Ring-Star Problem, Working Paper, ( U S WEST Advanced Technologies Inc., Boulder, CO., 1996).Google Scholar
  15. [15]
    J. Xu, S. Y. Chiu and F. Glover, Using Tabu Search to Solve the Steiner Tree-Star Problem in Telecommunications Network Design, Telecommunication Systems, 6 (1996), pp. 117–125.CrossRefGoogle Scholar
  16. [16]
    J. Xu, S. Y. Chiu and F. Glover, Probabilistic Tabu Search for Telecommunications Network Design, Combinatorial Optimization: Theory and Practice, Vol. 1, No. 1 (1996), pp. 69–94.Google Scholar
  17. [17]
    J. Xu, S. Y. Chiu and F. Glover, Tabu Search for Dynamic Routing Communications Network Design, Telecommunication Systems, 8 (1997), pp. 55–77.CrossRefGoogle Scholar
  18. [18]
    J. Xu, S. Y. Chiu and F. Glover, Fine-Tuning a Tabu Search Algorithm with Statistical Tests, International Transactions in Operational Research,5 (1998), pp. 233–244.Google Scholar
  19. [19]
    J. Xu, S. Y. Chiu and F. Glover, Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search, Management Science, Vol. 45, No. 3 (1998), pp. 330–345.CrossRefGoogle Scholar
  20. [20]
    J. Xu, S. Y. Chiu and F. Glover, Tabu Search and Evolutionary Scatter Search for “Tree-Star” Network Problems, with Applications to LeasedLIne Network Design, to appear in Telecommunications Optimization, David Corne(Ed.) (Wiley, 2000).Google Scholar
  21. [21]
    J. Xu, and J. P. Kelly, A New Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem, Transportation Sciences, vol. 30,No. 4 (1996), pp. 379–393.MATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Jie Feng Xu
    • 1
  • Steve Chiu
    • 2
  • Fred Glover
    • 3
  1. 1.Delta Technology, Inc.AtlantaUSA
  2. 2.Genuity Inc.BurlingtonUSA
  3. 3.Hearin Center for Enterprise ScienceUniversity of MississippiUSA

Personalised recommendations