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...

詳細記述

書誌詳細

主要な著者:	Muhammet Aktas, Fatih Kilic
フォーマット:	Artigo
言語:	Inglês
出版事項:	IEEE 2025-01-01
シリーズ:	IEEE Access
主題:	Combinatorial optimization metaheuristic random key method starfish optimization algorithm travelling salesman problem 2-opt algorithm
オンライン･アクセス:	https://ieeexplore.ieee.org/document/11031408/
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!