In this chapter we propose a new class of cellular algorithms. There exists a variety of
cellular algorithm approaches but most of them do not structure the search process. In this …

In this paper a GRASP algorithm hybridized with a composite local search and path-
relinking is proposed to solve the linear ordering problem with cumulative costs. Our …

In this paper, the NP-hard problem of minimizing power consumption in wireless
communications systems is approached. In the literature, several metaheuristic approaches …

Some optimization problems need to finding a permutation of a given set of items that
minimizes a certain cost function. This paper introduces an effective memetic algorithm for …

In this paper the linear ordering problem with cumulative costs (LOPCC) is approached.
Currently, a tabu search and a GRASP with evolutionary path-relinking have been proposed …

This paper presents a Population-based Strategic Oscillation (denoted by PBSO) algorithm
for solving the linear ordering problem with cumulative costs (denoted by LOPCC). The …

This paper introduces an effective memetic algorithm for the linear ordering problem with
cumulative costs. The proposed algorithm combines an order-based recombination operator …