Path relinking for the fixed spectrum frequency assignment problem
X Lai, JK Hao - Expert Systems with Applications, 2015 - Elsevier
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 …
in modern wireless systems. This paper presents the first path relinking (PR) approach for …
Nash-Pareto genetic algorithm for the frequency assignment problem
This paper presents a hybrid multi-objective genetic algorithm which combines the main
notion of game theory Nash equilibrium with Pareto-optimality to solve the multi-objective …
notion of game theory Nash equilibrium with Pareto-optimality to solve the multi-objective …
Channel assignment in mobile networks based on geometric prediction and random coloring
The channel assignment problem in mobile networks can be modeled as a temporal graph
coloring problem where a temporal graph represents a sequence of graphlets generated …
coloring problem where a temporal graph represents a sequence of graphlets generated …
[BUKU][B] Wireless networks and mobile computing
Wireless communication is one of the fastest growing industry segments today. Many types
of wireless networks are now being used for applications such as personal communication …
of wireless networks are now being used for applications such as personal communication …
Frequency assignment problem with net filter discrimination constraints
Managing radio spectrum resources is a crucial issue. The frequency assignment problem
(FAP) basically aims to allocate limited number of frequencies to communication links in an …
(FAP) basically aims to allocate limited number of frequencies to communication links in an …
A two-phase knowledge based hyper-heuristic scheduling algorithm in cellular system
B Dong, L Jiao, J Wu - Knowledge-Based Systems, 2015 - Elsevier
In this paper, we investigate the resource scheduling assignment problem in cellular mobile
networks by considering both the inter-cell interference and intra-cell interference …
networks by considering both the inter-cell interference and intra-cell interference …
Study of reassignment strategy in dynamic channel allocation scheme
In this work, an efficient channel utilization scheme based on the Distributed Dynamic
Channel Assignment (DDCA) is proposed. It can handle three types of constraints Adjacent …
Channel Assignment (DDCA) is proposed. It can handle three types of constraints Adjacent …
A probabilistic greedy algorithm with forced assignment and compression for fast frequency assignment in cellular network
This paper presents a probabilistic greedy algorithm for solving the channel assignment
problem (CAP) in cellular networks. We took each call as a vertex of a complete edge …
problem (CAP) in cellular networks. We took each call as a vertex of a complete edge …
Harmony search based algorithms for the minimum interference frequency assignment problem
Abstract The Minimum Interference Frequency Assignment Problem (MI-FAP) is a
particularly hard combinatorial optimization problem. It consists in the assignment of a …
particularly hard combinatorial optimization problem. It consists in the assignment of a …
Breakout variable neighbourhood search for the minimum interference frequency assignment problem
Purpose This paper aims to describe two enhancements of the variable neighbourhood
search (VNS) algorithm to solve efficiently the minimum interference frequency assignment …
search (VNS) algorithm to solve efficiently the minimum interference frequency assignment …