Abstract The Traveling Salesman Problem (TSP) is a classic combinatorial optimization
problem with various industrial applications. This paper proposes a discrete cuckoo search …

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 how to apply firefly algorithm (FA) for travelling salesman problem
(TSP). Two schemes are studied, ie discrete distance between two fireflies and the …

This study addresses a highly constrained NP-hard problem called the team orienteering
problem with time windows (TOPTW), which belongs to a well-known class of vehicle routing …

Traveling Salesman Problem (TSP) is a significant combinatorial optimization problem. TSP
is NP-hard problem which involves finding the minimum tour length among a given set of …

To solve travelling salesman problems (TSPs), most existing evolutionary algorithms search
for optimal solutions from zero initial information without taking advantage of the historical …

In this paper, a novel constructive-optimizer neural network (CONN) is proposed for the
traveling salesman problem (TSP). CONN uses a feedback structure similar to Hopfield-type …

We introduce an experimentation procedure for evaluating and comparing optimization
algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run …

The travelling salesman problem (TSP) is a classic problem of combinatorial optimization
and has applications in planning, scheduling, and searching in many scientific and …

The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is
useful in a number of applications. Since there is no known polynomial-time algorithm for …