Initialization of metaheuristics is a crucial topic that lacks a comprehensive and systematic
review of the state of the art. Providing such a review requires in‐depth study and …

The problem of maximizing diversity or dispersion deals with selecting a subset of elements
from a given set in such a way that the distance among the selected elements is maximized …

As a usual model for a variety of practical applications, the maximum diversity problem
(MDP) is computational challenging. In this paper, we present an opposition-based memetic …

This paper presents extensive computational experiments to compare 10 heuristics and 20
metaheuristics for the maximum diversity problem (MDP). This problem consists of selecting …

Maximum diversity problems arise in many practical settings from facility location to social
networks, and constitute an important class of NP-hard problems in combinatorial …

We propose several new hybrid heuristics for the differential dispersion problem, the best of
which consists of a GRASP with sampled greedy construction with variable neighborhood …

This paper presents a highly effective memetic algorithm for the maximum diversity problem
based on tabu search. The tabu search component uses a successive filter candidate list …

Graph matching is a fundamental problem in computer vision. In this paper, we propose a
novel graph matching algorithm based on tabu search. The proposed method solves graph …

The problem of choosing a subset of elements with maximum diversity from a given set is
known as the maximum diversity problem. Many algorithms and methods have been …

This paper presents a variable neighborhood search (VNS) heuristic for solving the heaviest
k-subgraph problem. Different versions of the heuristic are examined including 'skewed'VNS …