Variable neighborhood search variants for Min-power symmetric connectivity problem

详细信息    查看全文

• 作者：A.I. Erzin^a ; ^b ; ^{adilerzin@math.nsc.ru} ; N. Mladenovic^b ; ^c ; ^{nenadmladenovic12@gmail.com} ; R.V. Plotnikov^a ; ^{nomad87@ngs.ru}
• 关键词：Wireless sensor network ; Energy efficiency ; NP-hard problem ; Variable neighborhood search
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：557-563
• 全文大小：665 K
• 卷排序：78

文摘

Proposed new local search that is based on elementary tree transformation (ETT). In terms of solution quality it significantly outperforms the previous one (named as LI), but uses more computation time. Several basic VNS- and general VNS-based heuristics are proposed and tested. Some of these new heuristics give results of better quality than the recent state-of-the-art (hybrid heuristic [4]) technique, especially for solving more realistic large size problems. A simulation has been executed. Its results demonstrated high efficiency of the majority of the proposed methods.