Meta-Heuristic Algorithm for Travelling Salesman Problem
-
Updated
May 20, 2022 - Python
Meta-Heuristic Algorithm for Travelling Salesman Problem
Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize routes for package deliveries. Written in Python. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.
Approximate Shortest Superstring Generator
Add a description, image, and links to the approximation-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the approximation-algorithm topic, visit your repo's landing page and select "manage topics."