ebrahimpichka/attn-PG-RL-tsp

A PyTorch implementation of the attention-based Policy Gradient RL for learning to solve Travelling Salesperson Problem based on the paper https://doi.org/10.1007/978-3-319-93031-2_12

21
/ 100
Experimental

This is a tool for researchers and developers working on optimization problems. It takes a set of locations for a Traveling Salesperson Problem (TSP) and produces a route designed to be the most efficient. This is useful for anyone exploring advanced algorithmic approaches to routing and logistics.

No commits in the last 6 months.

Use this if you are a researcher or advanced developer experimenting with deep learning and reinforcement learning to solve complex routing problems like TSP.

Not ideal if you need a production-ready, off-the-shelf solution for logistics or a simple heuristic algorithm without deep learning components.

operations-research logistics-optimization route-planning algorithm-research neural-networks
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 5 / 25
Maturity 8 / 25
Community 8 / 25

How are scores calculated?

Stars

9

Forks

1

Language

Jupyter Notebook

License

Last pushed

May 30, 2023

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/ebrahimpichka/attn-PG-RL-tsp"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.