Create app.py

app.py

@@ -0,0 +1,44 @@
+import numpy as np
+import math
+
+def euclidean(a, b):
+    return math.dist(a, b)
+
+def clarke_wright(coords, demands, vehicle_capacity):
+    """
+    coords: list of (x,y), first is depot
+    demands: list of demands (first is 0 for depot)
+    """
+    N = len(coords) - 1
+    depot = 0
+    
+    # Distance matrix
+    dist = [[euclidean(coords[i], coords[j]) for j in range(len(coords))] for i in range(len(coords))]
+    
+    # Start with each customer in its own route
+    routes = [[0, i, 0] for i in range(1, N+1)]
+    loads = [demands[i] for i in range(1, N+1)]
+    
+    # Compute savings
+    savings = []
+    for i in range(1, N+1):
+        for j in range(i+1, N+1):
+            s = dist[i][0] + dist[j][0] - dist[i][j]
+            savings.append((s, i, j))
+    savings.sort(reverse=True)
+    
+    # Merge routes
+    for s, i, j in savings:
+        r_i = next((r for r in routes if r[1] == i or r[-2] == i), None)
+        r_j = next((r for r in routes if r[1] == j or r[-2] == j), None)
+        
+        if r_i is None or r_j is None or r_i == r_j:
+            continue
+        
+        if r_i[-2] == i and r_j[1] == j and (sum(demands[k] for k in r_i[1:-1]+r_j[1:-1]) <= vehicle_capacity):
+            new_route = r_i[:-1] + r_j[1:]
+            routes.remove(r_i)
+            routes.remove(r_j)
+            routes.append(new_route)
+    
+    return routes, dist