Multi-Agent Path Finding (MAPF) is the problem of finding a set collision-free paths for team agents in common environment. MAPF NP-hard to solve optimally and, some cases, also bounded-suboptimally. It thus time-consuming (bounded-sub)optimal solvers large instances. Anytime algorithms find solutions quickly instances and then improve them close-to-optimal ones over time. In this paper, we cur...

We consider the generalized minimum edge-biconnected network problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster is required to be connected in an edge-biconnected way. Instances of this problem appear, for example, in the design of survivable backbone networks. We present different variants of a variable neighborhood search approach that util...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

In this paper, we report the results of our investigation of an evolutionary approach for solving the unequal area multi-objective facility layout problem (FLP) using the variable neighborhood search (VNS) with an adaptive scheme that presents the final layouts as a set of Pareto-optimal solutions. The unequal area FLP comprises a class of extremely difficult and widely applicable optimization ...

The maximally diverse grouping problem (MDGP) is a relevant NP-hard optimization with number of real-world applications. However, solving large instances the computationally challenging. This work dedicated to new heuristic algorithm for problem, which distinguishes itself by two original features. First, it introduces first neighborhood decomposition strategy accelerate examinations. Second, i...

We propose the new framework of the distributed tabu search metaheuristic designed to be executed using a multi-GPU cluster, i.e. cluster of nodes equipped with GPU computing units. We propose a hybrid single-walk parallelization of the tabu search, where hybridization consists in examining a number of solutions from a neighborhood concurrently by several GPUs (multi-GPU). The methodology is de...