22,629 research outputs found
Using Differential Evolution for the Graph Coloring
Differential evolution was developed for reliable and versatile function
optimization. It has also become interesting for other domains because of its
ease to use. In this paper, we posed the question of whether differential
evolution can also be used by solving of the combinatorial optimization
problems, and in particular, for the graph coloring problem. Therefore, a
hybrid self-adaptive differential evolution algorithm for graph coloring was
proposed that is comparable with the best heuristics for graph coloring today,
i.e. Tabucol of Hertz and de Werra and the hybrid evolutionary algorithm of
Galinier and Hao. We have focused on the graph 3-coloring. Therefore, the
evolutionary algorithm with method SAW of Eiben et al., which achieved
excellent results for this kind of graphs, was also incorporated into this
study. The extensive experiments show that the differential evolution could
become a competitive tool for the solving of graph coloring problem in the
future
A Novel Multiobjective Cell Switch-Off Framework for Cellular Networks
Cell Switch-Off (CSO) is recognized as a promising approach to reduce the
energy consumption in next-generation cellular networks. However, CSO poses
serious challenges not only from the resource allocation perspective but also
from the implementation point of view. Indeed, CSO represents a difficult
optimization problem due to its NP-complete nature. Moreover, there are a
number of important practical limitations in the implementation of CSO schemes,
such as the need for minimizing the real-time complexity and the number of
on-off/off-on transitions and CSO-induced handovers. This article introduces a
novel approach to CSO based on multiobjective optimization that makes use of
the statistical description of the service demand (known by operators). In
addition, downlink and uplink coverage criteria are included and a comparative
analysis between different models to characterize intercell interference is
also presented to shed light on their impact on CSO. The framework
distinguishes itself from other proposals in two ways: 1) The number of
on-off/off-on transitions as well as handovers are minimized, and 2) the
computationally-heavy part of the algorithm is executed offline, which makes
its implementation feasible. The results show that the proposed scheme achieves
substantial energy savings in small cell deployments where service demand is
not uniformly distributed, without compromising the Quality-of-Service (QoS) or
requiring heavy real-time processing
A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring
The Artificial Bee Colony (ABC) is the name of an optimization algorithm that
was inspired by the intelligent behavior of a honey bee swarm. It is widely
recognized as a quick, reliable, and efficient methods for solving optimization
problems. This paper proposes a hybrid ABC (HABC) algorithm for graph
3-coloring, which is a well-known discrete optimization problem. The results of
HABC are compared with results of the well-known graph coloring algorithms of
today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of
the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive
experimentations has shown that the HABC matched the competitive results of the
best graph coloring algorithms, and did better than the traditional heuristics
EA-SAW when solving equi-partite, flat, and random generated medium-sized
graphs
- …