Scholarlink

Abstract <p> We consider a stadium antenna deployment problem. The stadium is divided into sectors.Several antennas are assigned to each sector. Users should receive a signal of a certain qualityfrom antennas assigned to their sector. The problem is to choose locations of antennas, theirtypes, angles, and assignments to sectors to maximize three quality criteria: the mean signal tointerference ratio (SIR), the number of clients with good signal quality, and the assignmentconsistency. We use a simulation to compute the signal quality. We present a three-stage heuristicapproach to the problem. It uses a constructive heuristic, a local improvement procedure, anda decomposition-based MIP heuristic. We carry out numerical experiments on test instances with94 antennas of 7 types, 19 sectors, and 4426 clients. It is possible to improve the provided baselinesolutions in 2 h and obtain solutions comparable to running a metaheuristic package for 24 h.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Decomposition Approach to a Stadium Antenna Deployment Problem

  • 期刊论文

  • 发表日期：

    2025年11月2日

查看全文
  • A. D. Yuskov

摘要

Abstract

We consider a stadium antenna deployment problem. The stadium is divided into sectors.Several antennas are assigned to each sector. Users should receive a signal of a certain qualityfrom antennas assigned to their sector. The problem is to choose locations of antennas, theirtypes, angles, and assignments to sectors to maximize three quality criteria: the mean signal tointerference ratio (SIR), the number of clients with good signal quality, and the assignmentconsistency. We use a simulation to compute the signal quality. We present a three-stage heuristicapproach to the problem. It uses a constructive heuristic, a local improvement procedure, anda decomposition-based MIP heuristic. We carry out numerical experiments on test instances with94 antennas of 7 types, 19 sectors, and 4426 clients. It is possible to improve the provided baselinesolutions in 2 h and obtain solutions comparable to running a metaheuristic package for 24 h.