LEADERS AND FOLLOWERS ALGORITHM FOR TRAVELING SALESMAN PROBLEM
Leaders and Followers algorithm is a metaheuristics algorithm. In solving continuous optimization, this algorithm is proved to be better than other well-known algorithms, such as Genetic Algorithm and Particle Swarm Optimization. This paper aims to apply
Helen Yuliana Angmalisang, Syaiful Anam
doaj +1 more source
IAM-TSP: Iterative Approximate Methods for Solving the Travelling Salesman Problem
Esra’a Alkafaween +5 more
openaire +1 more source
Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm [PDF]
The Traveling Salesman Problem (TSP) is a well-known problem in optimization and graph theory, where finding the optimal solution has always been of significant interest.
Ahmad Aliyari Boroujeni, Ameneh Khadivar
doaj
Employing in-context learning prompts with large language models for drone routing in delivery services. [PDF]
Masoud M, Elhenawy M, Abdelhay A.
europepmc +1 more source
Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]
Zhang R +17 more
europepmc +1 more source
Information Bottleneck-Enhanced Reinforcement Learning for Solving Operation Research Problems. [PDF]
Xi R, Ni Y, Wu W.
europepmc +1 more source
Information-Theoretic Intrinsic Motivation for Reinforcement Learning in Combinatorial Routing. [PDF]
Xi R, Ni Y, Wu W.
europepmc +1 more source
A carbon aware ant colony system for the sustainable generalized traveling salesman problem. [PDF]
Lin M, Schaposnik LP.
europepmc +1 more source
Traveling salesman problem solution using magnonic combinatorial device. [PDF]
Balinskyy M, Khitun A.
europepmc +1 more source
MCAH-ACO: A Multi-Criteria Adaptive Hybrid Ant Colony Optimization for Last-Mile Delivery Vehicle Routing. [PDF]
Chu DT, Cheng XY, Bai LY, Ling HF.
europepmc +1 more source

