Fully automated, constraint-driven solution to the NP-hard TSP, featuring dynamic package loading with no hardcoded logic. Handles deadlines, groupings, delays, and truck constraints using a multi-phase optimization strategy that minimizes distance while meeting all delivery requirements.
testing constraint-satisfaction-problem python3 data-structures nearest-neighbor-search cli-app permutation academic-project hashtable logistics tsp-problem python-algorithms route-optimization 2-opt wgups
-
Updated
May 22, 2025 - Python