Solving the shortest path based on the traveling salesman problem with a genetic algorithm in a Fermatean neutrosophic environment.
| Autor: | Raut, Prasanta Kumar1 prasantaraut95@gmail.com, Pramanik, Surapati2 sura_pati@yahoo.co.in, Mohapatra, Deepak Kumar3 deepakmechachamp@gmail.com, Sahoo, Srikanta Kumar4 sks.nita@gmail.com |
|---|---|
| Zdroj: | Neutrosophic Sets & Systems. 2025, Vol. 78, p353-366. 14p. |
| Databáze: | Academic Search Ultimate |
| Externí odkaz: |
|