article · Decision Making Applications in Management and Engineering
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to a class of problems known as NP-hard, which is an exceptional case of travelling salesman problem (TSP), which determines a set of routes enabling multiple salesmen to start at and return to home cities (depots). The penguins search optimization algorithm (PeSOA) is a new metaheuristic optimization algorithm. In this paper, we present a discrete penguins search optimization algorithm (PeSOA) for solving the multiple travelling salesman problem (MTSP). The PeSOA evaluated by a set of benchmarks of TSP instance from TSPLIB library. The experimental results show that PeSOA is very efficient in finding the right solutions in a reasonable time
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.31181/dmame04092023m
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
