Browse > Article

A Tabu Search Algorithm for the Network Diversion Problem  

양희원 (한국과학기술원 산업공학과)
박성수 (한국과학기술원 산업공학과)
Publication Information
Journal of the military operations research society of Korea / v.30, no.1, 2004 , pp. 30-47 More about this Journal
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
network diversion; NP-hard; tabu search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI   ScienceOn
2 Ozgrur Erken, 'A branch and bound algorithm for the network diversion problem,' Master's Thesis, Naval postgraduate School, Monterey, California, 2002
3 F. Glover, 'Tabu Search-Part I,' ORSA Journal on Computing, Vol.(3), pp.190-206, 1989   DOI
4 S. Fortune, J. Hopcroft and J. Wyllie, 'The directed subgraph homeomorphism problem,' Theoretical Computer Science, Vol.10(2), pp.111-121, 1980   DOI   ScienceOn
5 김여근, 윤복식, 이상복, 메타 휴리스틱, pp452, 영지문화사, 1999
6 F. Barahona and A.R. Mahjoub, 'On the Cut Polytope,' Mathematical Programming, Vol.36(2), pp.157-173, 1986   DOI
7 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   DOI   ScienceOn
8 A. Hertz and D.de Werra, 'Using Tabu Search Techniques for Graph Coloring,' Computing, Vol.45, pp.345-351, 1987   DOI
9 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   DOI
10 F. Glover, 'Future Paths for Integer Programming and Links to Artificial Intelligence,' Computers & Operations Research, Vol.13(5), pp.533-549, I986   DOI   ScienceOn
11 Norman D. Curet, 'The Network Diversion Problem,' Military Operations Research, Vol.6, pp.35-44, 2001