In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
— Metaheuristics such as Estimation of Distribution Algorithms and the Cross-Entropy method use probabilistic modelling and inference to generate candidate solutions in optimizat...
Marcus Gallagher, Ian Wood, Jonathan M. Keith, Geo...
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...