The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to class of problems known as NP-hard, which an exceptional case travelling salesman (TSP), determines set routes enabling multiple salesmen start at and return home cities (depots). penguins search algorithm (PeSOA) new metaheuristic algorithm. In this paper, we present discrete for solving th...

We present the concept of “problem perturbation“, give the specifications of an application to the Travenling Salesperson Problem (TSP), then discuss an empiricd study of the fitness landscape induced by the variation operators in that application.

We are interested in characterizing the compact sets of the Heisenberg group that are contained in a curve of finite length. Ferrari, Franchi and Pajot recently gave a sufficient condition for those sets, adapting a necessary and sufficient condition due to P. Jones in the Euclidean setting. We prove that this condition is not necessary.