diego-vicente/ntnu-som
Using Self-Organizing Maps for Travelling Salesman Problem
This project helps operations managers, logistics planners, or delivery services find efficient routes. You provide a list of locations (cities or stops), and it uses a clever algorithm to suggest a near-optimal travel sequence. The result is a proposed path that aims to minimize the total travel distance, useful for optimizing deliveries, field service routes, or sales territory planning.
No commits in the last 6 months.
Use this if you need a quick and good-enough solution for arranging multiple stops into an efficient route without needing the absolute perfect, mathematically proven shortest path.
Not ideal if your application requires the absolute shortest possible route for mission-critical operations, as this method prioritizes speed over guaranteed optimality.
Stars
44
Forks
10
Language
Python
License
MIT
Category
Last pushed
Dec 08, 2016
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/diego-vicente/ntnu-som"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
JustGlowing/minisom
:red_circle: MiniSom is a minimalistic implementation of the Self Organizing Maps
felixriese/susi
SuSi: Python package for unsupervised, supervised and semi-supervised self-organizing maps (SOM)
abhinavralhan/kohonen-maps
Implementation of SOM and GSOM
saeyslab/FlowSOM_Python
The complete FlowSOM package known from R, now available in Python!
LCSB-BioCore/GigaSOM.jl
Huge-scale, high-performance flow cytometry clustering in Julia