Journal of the military operations research society of Korea (한국국방경영분석학회지)

Military Operations Research Society of Korea (한국국방경영분석학회)
권호 표지

A Tabu Search Algorithm for the Network Diversion Problem

네트워크 전환문제에 대한 타부 탐색 해법

  • 양희원 (한국과학기술원 산업공학과) ;
  • 박성수 (한국과학기술원 산업공학과)
  • Published : 2004.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

Keywords

References

  1. 김여근, 윤복식, 이상복, 메타 휴리스틱, pp452, 영지문화사, 1999
  2. A. Hertz and D.de Werra, 'Using Tabu Search Techniques for Graph Coloring,' Computing, Vol.45, pp.345-351, 1987 https://doi.org/10.1007/BF02239976
  3. C. Friden, A. Hertz and D.de Werra, 'STABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search,' Computing, Vol.42, pp.35-44, 1989 https://doi.org/10.1007/BF02243141
  4. D.R. Shier and D.E. Whited, 'Algorithms for generating minimal cutsets by inversion,' IEEE TRANSACTIONS ON REIlABILITY, Vol.R-34(4), pp.314-319, 1985 https://doi.org/10.1109/TR.1985.5222173
  5. F. Barahona and A.R. Mahjoub, 'On the Cut Polytope,' Mathematical Programming, Vol.36(2), pp.157-173, 1986 https://doi.org/10.1007/BF02592023
  6. F. Glover, 'Future Paths for Integer Programming and Links to Artificial Intelligence,' Computers & Operations Research, Vol.13(5), pp.533-549, I986 https://doi.org/10.1016/0305-0548(86)90048-1
  7. F. Glover, 'Tabu Search-Part I,' ORSA Journal on Computing, Vol.(3), pp.190-206, 1989 https://doi.org/10.1287/ijoc.1.3.190
  8. J.A. Diaz and E. Fernandez, 'A Tabu search heuristic for the generalized assignment problem,' European Journal of Operational Research, Vol.132(1), pp.22-38, 2001 https://doi.org/10.1016/S0377-2217(00)00108-9
  9. Norman D. Curet, 'The Network Diversion Problem,' Military Operations Research, Vol.6, pp.35-44, 2001
  10. Ozgrur Erken, 'A branch and bound algorithm for the network diversion problem,' Master's Thesis, Naval postgraduate School, Monterey, California, 2002
  11. S. Fortune, J. Hopcroft and J. Wyllie, 'The directed subgraph homeomorphism problem,' Theoretical Computer Science, Vol.10(2), pp.111-121, 1980 https://doi.org/10.1016/0304-3975(80)90009-2