A hybrid algorithm to bypass some weak features in the particle swarm and firefly algorithms...with an application to the traveling salesman problem
In this paper, the Traveling Salesman Problem (TSP) is solved through the use of some approximation techniques where the results of the previous work showed some defects in solving the problem to obtain an optimal or close to optimal solution,so the use of hybrid algorithms to solve some results fro...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Árabe |
| Izdano: |
Tikrit University
2023-02-01
|
| Serija: | Tikrit Journal of Administrative and Economic Sciences |
| Teme: | |
| Online pristup: | https://tjaes.org/index.php/tjaes/article/view/641 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|