This article presents a new approach for solving TSP called an evolutionary algorithm. An evolutionary algorithm loosely mimics biological crossover (combining two existing parent solutions to create ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

Comparing the search time with a representative TSP algorithm "2-opt," the electronic amoeba becomes more advantageous as the number of cities increases.

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...

Comparing the search time with a representative TSP algorithm "2-opt," the electronic amoeba becomes more advantageous as the number of cities increases.

As the BTTP requires a distance-optimal schedule linking venues in close proximity, we provide an approximation algorithm for the BTTP based on an approximate solution to the corresponding TSP.