No abstract

No abstract

No abstract

Purpose-This paper investigates to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement problem. Design/methodology/approach-This problem is stated as a unicost set covering problem (USCP) and 18 problem instances are defined according to practical operational needs. Three methods are selected from the literature to solve these instances: a CPLEX solver, a greedy algorithm, and a row weighting local search (RWLS). Then, it is proposed to hybridize these algorithms with two DE approaches designed for combinatorial optimization problems. The first one is a set-based approach (DEset) from the literature. The second one is a new similarity-based approach (DEsim) that takes advantage of the geometric characteristics of a camera in order to find better solutions. Findings-The experimental study highlights that RWLS and DEsim-CPLEX are the best proposed algorithms. Both easily outperform CPLEX, and it turns out that RWLS performs better on one class of problem instances, whereas DEsim-CPLEX performs better on another class, depending on the minimal resolution needed in practice. Originality/value-Up to now, the efficiency of RWLS and the DEset approach has been investigated only for a few problems. Thus, the first contribution is to apply these methods for the first time in the context of camera placement. Moreover, new hybrid DE algorithms are proposed to solve the optimal camera placement problem when stated as a USCP. The second main contribution is the design of the DEsim approach that uses the distance between camera locations in order to fully benefit from the DE mutation scheme.

Metaheuristics have been showing interesting results in solving hard optimization problems. However, they become limited in terms of effectiveness and runtime for high dimensional problems. Thanks to the independency of metaheuristics components, parallel computing appears as an attractive choice to reduce the execution time and to improve solution quality. By exploiting the increasing performance and programability of graphics processing units (GPUs) to this aim, GPU-based parallel metaheuristics have been implemented using different designs. Recent results in this area show that GPUs tend to be effective co-processors for leveraging complex optimization problems. In this survey, mechanisms involved in GPU programming for implementing parallel metaheuristics are presented and discussed through a study of relevant research papers.