tsp_route_finder
0.2.0, released 3 weeks ago by an unverified publisher
Fast, dependency-free TSP and delivery route optimization for Dart and Flutter.
WASM-ready
What it does
Calculates the shortest travel route for a list of locations using the Traveling Salesman Problem solver and plans multi-vehicle deliveries respecting capacity, time windows, and shifts. Runs synchronously or asynchronously on a background isolate.
AI-written summary of version 0.2.0, based on the package's README and metadata. Report an inaccuracy
Use it when
- You need to find the shortest delivery or travel route for a list of stops.
- You are building a multi-vehicle delivery planner with capacities and time windows.
- You need route optimization that runs without external dependencies or heavy native setup.
Skip it when
- You need real-time turn-by-turn navigation UI rather than just route calculation.
- You expect built-in map rendering widgets (the package only provides calculation logic).
Strengths
- Dependency-free and pure Dart, working on all platforms including server/CLI.
- Provides both exact solutions for small inputs and optimized local search for thousands of stops.
- Includes multi-vehicle routing with capacity, time windows, and driver shifts.
Weaknesses
- Does not render maps or provide driving directions UI by itself.
- Custom distance functions passed to async methods must be top-level, static, or serialize cleanly.
Setup
- Kind
- Pure Dart
- Effort
- Low
- Code generation
- No
- Direct dependencies
- 0
import 'package:tsp_route_finder/tsp_route_finder.dart';
const stops = [
TspLocation(latitude: 30.0454, longitude: 31.2332, name: 'Cairo'),
TspLocation(latitude: 30.7865, longitude: 31.0012, name: 'Tanta'),
];
final result = TspRouteFinder.solve(stops, startIndex: 0);