Path relinking for the fixed spectrum frequency assignment problem

Abstract

The fixed spectrum frequency assignment problem (FS-FAP) is a highly relevant application in modern wireless systems. This paper presents the first path relinking (PR) approach for solving FS-FAP. We devise four relinking operators to generate intermediate solutions (or paths) and a tabu search procedure for local optimization. We also adopt a diversity-and-quality technique to maintain population diversity. To show the effectiveness of the proposed approach, we present computational results on the set of 42 benchmark instances commonly used in the literature and compare them with the current best results obtained by any other existing methods. By showing improved best results (new upper bounds) for 19 instances, we demonstrate the effectiveness of the proposed PR approach. We investigate the impact of the relinking operators and the population updating strategy. The ideas of the proposed could be applicable to other frequency assignment problems and search problems.

A heuristic for the minimum cost chromatic partition problem

“…Accounts of successful applications of path-relinking can be seen e.g. in [4,12,21,26,27,[29][30][31][32].…”

Multi-Objective Cluster Intelligent Algorithms for Railway Door-to-Door Transportation Routing Design

“…As a multi-neighborhood structure in the optimization process of Cluster Intelligent Algorithms, path relinking operator, as one of the most important components of path reconnection method, aims to generate new promising solutions by creating paths connecting two high-quality parent solutions [16], [17]. Neighborhood structure is the key of path reconnection.…”

GRASP with path relinking for the selective pickup and delivery problem

“…Besides hybridizing path relinking with GRASP, one can also find path relinking hybridized with tabu search (Jia & Hu, 2014;Lai & Hao, 2015;Peng, Lü, & Cheng, 2015;Urrutia, Milanés, & Løkketangen, 2015), local search (Yang, Zhang, & Zhu, 2015), population-based metaheuristics (F. B. de Oliveira, Enayatifar, Sadaei, Guimarães, & Potvin, 2015;Hamdi-Dhaoui, Labadie, & Yalaoui, 2014;Marinakis & Marinaki, 2015;Martí, Corberán, & Peiró, 2015;Ribas, Companys, & Tort-Martorell, 2015) and mathematical programming based approaches (R. M. de Oliveira, Lorena, Chaves, & Mauri, 2014;Li, Chu, Prins, & Zhu, 2014). One important component with path relinking is the neighborhood operator for moving from the initial solution to the guiding solution.…”