Abstract: The slime mould algorithm (SMA) simulates the mechanism by which slime moulds optimize paths through chemical signaling and morphological changes, enabling efficient exploration and ...
Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...
Abstract: The Traveling Salesman Problem (TSP) is a widely studied NP-complete optimization challenge with significant theoretical and practical implications. This study proposes a hybrid ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback