Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem

This paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP). The discrete SFOA algorithm is initialized with the initial population of classical SFOA, and the continuous values of the individuals in the popula...

Full description

Bibliographic Details
Published in:IEEE Access
Main Authors: Muhammet Aktas, Fatih Kilic
Format: Article
Language:English
Published: IEEE 2025-01-01
Subjects:
Combinatorial optimization
metaheuristic
random key method
starfish optimization algorithm
travelling salesman problem
2-opt algorithm
Online Access:https://ieeexplore.ieee.org/document/11031408/

Internet

https://ieeexplore.ieee.org/document/11031408/

Similar Items