네트워크 전환문제에 대한 타부 탐색 해법A Tabu Search Algorithm for the Network Diversion Problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 356
  • Download : 0
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.
Publisher
한국국방경영분석학회
Issue Date
2004-06
Language
Korean
Citation

한국국방경영분석학회지, v.30, no.1, pp.30 - 47

ISSN
1229-9898
URI
http://hdl.handle.net/10203/82189
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0