A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Abstract

In this paper, we propose a hybrid iterated local search (ILS) heuristic, named GPP4G-ILS, to solve the global planning problem of survivable wireless networks. The planning problem of wireless networks is to determine a set of sites among potential sites to install the various network devices in order to cover a given geographical area. It should also make the connections between the devices in accordance with well-defined constraints. The global planning consists in solving this problem without dividing it into several subproblems. The objective is to minimize the cost of the network while maximizing its survivability. The GPP4G-ILS algorithm is a new form of hybridization between the ILS algorithm and the integer linear programing (ILP) method. We propose a configuration that allows to reuse a previously developed ILP algorithm by integrating it in the ILS algorithm. This allows to benefit from the advantages of both methods. The ILS algorithm is used to effectively explore the search space, while the ILP algorithm is used to intensify the solutions obtained. The performance of the algorithm was evaluated using an exact method that generates optimal solutions for small instances. For larger instances, lower bounds have been calculated using a relaxation of the problem. The results show that the proposed algorithm is able to reach solutions that are, on average, within 0.06% of the optimal solutions and 2.43% from the lower bounds for the instances that cannot be solved optimally, within a reduced computation time. Index Terms-Fourth-generation (4G) networks design, global approach, hybrid methods, iterated local search (ILS), metaheuristics, reliability. 1063-6692 His research interests deal with the solution oflarge-scale instances of difficult (NP-hard) combinatorial problems by using metaheuristics, such as neighborhood search techniques and evolutionary algorithms, in particular memetic algorithms. The problems he studies include both academic problems (notably graph-related problems such as graph coloring, graph partitioning, graph matching, etc.) and various real-world applications, notably in the areas of telecommunication networks and software engineering.

A data-based multi-algorithm system for an end-to-end intelligent manufacturing process

“…Metaheuristics-based search is a technique used to address combinatorial optimization problems. It is typically designed to find the best possible solution within a reasonable time by using approximate search methods [29,30]. It contrasts with exact optimization techniques, which often seek a problem's optimum solution by exploring cost function properties or the full spectrum of feasible solutions.…”

“…It contrasts with exact optimization techniques, which often seek a problem's optimum solution by exploring cost function properties or the full spectrum of feasible solutions. Combinations of both approaches have been suggested in recent years, often being named hybrid methods [30].…”

IAMVT: Mecanismo de Seleção de Rotas Multicaminhos para Aplicações de Vídeo Monitoramento

“…O ILS, em especial, tem se apresentado como uma das melhores alternativas heurísticas para resolver diferentes problemas de otimizac ¸ão combinatória da classe NP-completo [Lourenc ¸o et al 2010]. Sua eficiência e simplicidade têm demonstrado o potencial para resolver problemas de roteamento de rede [Penna et al 2017, Lemamou et al 2016, assim como para selecionar rotas multicaminhos para transmissão de múltiplas fontes de vídeo [Bhering et al 2019].…”

Resource Allocation for Hybrid RF/FSO Multi-Channel Multi-Radio Wireless Mesh Networks

“…In the following, we show the performance of the proposed IILSA, and compare it with ILS [20], [41] and branchand-cut algorithms [42]. Considering the 16-node grid VOLUME 8, 2020 network shown in Fig.…”