
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
The disjunctively constrained knapsack problem consists in packing a sub...
read it

Variations on Memetic Algorithms for Graph Coloring Problems
Graph vertex coloring with a given number of colors is a wellknown and ...
read it

A Grover searchbased algorithm for the list coloring problem
Graph coloring is a computationally difficult problem, and currently the...
read it

Trustless parallel local search for effective distributed algorithm discovery
Metaheuristic search strategies have proven their effectiveness against ...
read it

On memetic search for the maxmean dispersion problem
Given a set V of n elements and a distance matrix [d_ij]_n× n among elem...
read it

Variable Population Memetic Search: A Case Study on the Critical Node Problem
Populationbased memetic algorithms have been successfully applied to so...
read it

Reformulating DOVERLap Label Mapping as a Graph Partitioning Problem
We recently proposed DOVERLap, a method for combining overlapaware spe...
read it
Massively parallel hybrid search for the partial Latin square extension problem
The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of relevant applications in diverse domains. This paper presents the first massively parallel hybrid search algorithm for this computationally challenging problem based on a transformation of the problem to partial graph coloring. The algorithm features the following original elements. Based on a very large population (with more than 10^4 individuals) and modern graphical processing units, the algorithm performs many local searches in parallel to ensure an intensified exploitation of the search space. It employs a dedicated crossover with a specific parent matching strategy to create a large number of diversified and informationpreserving offspring at each generation. Extensive experiments on 1800 benchmark instances show a high competitiveness of the algorithm compared with the current best performing methods. Competitive results are also reported on the related Latin square completion problem. Analyses are performed to shed lights on the understanding of the main algorithmic components. The code of the algorithm will be made publicly available.
READ FULL TEXT
Comments
There are no comments yet.