IEEE

Performance Evaluation of Heuristic and Meta-Heuristic Algorithms on Large-Scale Travelling Salesman Problem Instances

Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...
IEEE

A Method of the Traveling Salesman Problem Based On Q-Learning Reinforcement Learning and Local Dynamic Programming

Abstract: This study explores optimizing the Traveling Salesman Problem (TSP) using Q-Learning reinforcement learning. The proposed method builds a Q-table to learn the optimal path and employs ...
GitHub

LLM4AD: Large Language Model for Algorithm Design

LLM4AD is an open-source Python-based Platform leveraging Large Language Models (LLMs) for Automatic Algorithm Design (AD). Please refer to the paper [LLM4AD] for detailed information, including the ...
GitHub

High-performance Python rate limiting library with multiple algorithms (Fixed Window, Sliding Window, Token Bucket, Leaky Bucket & GCRA) and storage backends (Redis, In ...

in-memory Use In-Memory as storage backend. redis Use Redis as storage backend. If you want to throttle the same Key at different locations in your program, make sure that Throttled receives the same ...