We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman problem. Our approaches unify previously known results and offer schemas for generating additional expone...

We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman problem. Our approaches are intended both to unify previously known results as well as to offer schemas f...

1

We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem, and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective fun...

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these t...

This paper proposes a new multi-objective evolutionary algorithm, called neighborhood exploring evolution strategy (NEES). This approach incorporates the idea of neighborhood exploration together with other techniques commonly used in the multi-objective evolutionary optimization literature (namely, non-dominated sorting and diversity preservation mechanisms). This idea of the proposed approach...

Group search optimizer(GSO) is a new novel optimization algorithm by simulating animal behaviour. It uses the Gbest topology structure, which leads to rapid exchange of information among particles. So,it is easily trapped into a local optima when dealing with multi-modal optimization problems. In this paper,inspiration from the Newman and Watts model,a improved group search optimizer with inter...

We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to multi-robot search scenarios. The neighborhood structure of PSO is modified to accurately represent feasible neighborhoods in multiple robot systems with limited communication in several different ways. The new algorithms are test...

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a proble...