渡线
进化算法
计算机科学
树(集合论)
节点(物理)
地点
编码(内存)
数学优化
无线网络
树形结构
无线传感器网络
编码
算法
无线
数学
人工智能
计算机网络
二叉树
工程类
电信
数学分析
语言学
哲学
生物化学
化学
结构工程
基因
作者
Pei-Qiu Huang,Shaoda Zeng,Xilei Wu,Hai‐Lin Liu,Qingfu Zhang
标识
DOI:10.1109/tnse.2024.3356652
摘要
Deploying in-building distributed antenna systems (IB-DAS) is a crucial step towards providing ubiquitous wireless services. In this paper, we study the multiobjective network planning problem, aiming to minimize both construction costs and average power loss. The main challenge in solving this problem is efficiently representing the network structure. To address this, we encode the network structure as a spanning tree, with the root node connecting to the signal source, and leaf and non-leaf nodes representing all floors and power devices, respectively. Compared to existing encodings, this tree encoding offers several advantages, including improved locality and the ability to easily generate valid solutions. Additionally, we propose a tree-encoded evolutionary algorithm called TMOEA. Since the standard operators cannot be applied, we devise problem-specific crossover and mutation operators to produce tree-encoded solutions. Moreover, the Tchebycheff approach is employed to update solutions. Comprehensive experiments on 11 test instances with up to 30 floors demonstrate that the proposed algorithm outperforms four compared algorithms in terms of both the hypervolume indicator and the inverted generational distance indicator for each test instance.
科研通智能强力驱动
Strongly Powered by AbleSci AI