Heuristic computational intelligence techniques are widely used in combinatorial
optimization problems, essentially in large size configurations. Bio-inspired heuristics such …

This paper addresses the covering salesman problem (CSP), which is an extension of the
classical traveling salesman problem (TSP). Given a set of cities and a coverage radius …

In this paper, a hybrid algorithm is proposed for travelling salesman problem (TSP). TSP,
one of the vehicle route planning problems, is to minimize the cost of travel of a salesman in …

Crow search algorithm is one of bio-inspired optimization algorithms which is essentially
derived for solving continuous based optimization problems. Although many main-frame …

This paper presents a competitive Particle Swarm Optimization algorithm for the Traveling
Salesman Problem, where the velocity operator is based upon local search and path …

The traveling salesman problem (TSP) is one of the most important issues in combinatorial
optimization problems that are used in many engineering sciences and has attracted the …

Bioinspired algorithms, such as evolutionary algorithms and ant colony optimization, are
widely used for different combinatorial optimization problems. These algorithms rely heavily …

In this paper we present a new population based metaheuristic called the fixed set search
(FSS). The proposed approach represents a method of adding a learning mechanism to the …

Cuckoo search (CS) belongs to a class of novel nature-inspired algorithm inspired by the
obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other …

This paper addresses the recently introduced colored traveling salesman problem (CTSP),
which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a …