| Autor: |
Mzili, Ilyass, Mzili, Toufik, Riffi, Mohammed Essaid |
| Předmět: |
|
| Zdroj: |
Decision Making: Applications in Management & Engineering (DMAME); Oct2023, Vol. 6 Issue 2, p730-743, 14p |
| Abstrakt: |
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 a 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. This paper presents a discrete penguins search optimization algorithm (PeSOA) for solving the multiple traveling salesman problem (MTSP). A set of benchmarks of TSP instances from TSPLIB library evaluates the PeSOA. The experimental results show that PeSOA is very efficient in finding the right solutions in a reasonable time. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
