MaxMinMin p-dispersion problem: A variable neighborhood search approach
In this work we have developed a Variable Neighborhood Search (VNS) method in order to solve the MaxMinMin p-dispersion problem, which adds a new type of plateau search mechanism to the classical VNSmetaheuristic framework. Besides, several other contributions have been made to the basic VNSheuristic in terms of the ascent and perturbation functions. To the best of our knowledge this is the first application of the VNSto the MaxMinMin problem and our approach, compared to previous methods, finds or improves the results for all of the large-sized benchmarks with low computational efforts. Finding most of the proven optimal solutions in a fraction of a second, the robustness and quality of the solutions and the low complexity of the methods demonstrate the strength of the proposed heuristic solution procedures.
variable neighborhood search combinatorial optimization dispersion problems metaheuristics