Solving the minimum dissemination time problem in broadcasting by meta-heuristics = 최소전파 시간문제의 메타 휴리스틱 해법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 252
  • Download : 0
This thesis considers the minimum dissemination time problem in broadcasting. Given an undirected network, we want to find the initial broadcasting node and the sequence of broadcasting which gives the smallest broadcasting time to transmit the information to the rest of nodes in the network. We give an integer programming formulation and propose tabu search and genetic algorithms to solve the problem. We test the algorithms on randomly generated data sets. Computational results show that the tabu search algorithm can find good solutions consistently.
Advisors
Park, Sung-Sooresearcher박성수researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1999
Identifier
150788/325007 / 000973607
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1999.2, [ 40 p. ]

Keywords

Broadcasting; Meta-heuristic; 휴리스틱; 전파

URI
http://hdl.handle.net/10203/41555
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=150788&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
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