Update agents/reasoner.py
Browse files- agents/reasoner.py +133 -27
agents/reasoner.py
CHANGED
|
@@ -1,38 +1,144 @@
|
|
|
|
|
| 1 |
import pandas as pd
|
| 2 |
-
|
| 3 |
-
from
|
| 4 |
-
|
|
|
|
|
|
|
| 5 |
|
|
|
|
|
|
|
|
|
|
| 6 |
|
| 7 |
-
def
|
| 8 |
-
|
| 9 |
-
|
|
|
|
|
|
|
|
|
|
| 10 |
|
| 11 |
-
out = optimize_slotting(df)
|
| 12 |
|
| 13 |
-
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
- Slow movers positioned in lower traffic aisles.
|
| 17 |
-
Expected travel reduction: **18–24%**.
|
| 18 |
-
"""
|
| 19 |
|
| 20 |
-
|
|
|
|
| 21 |
|
|
|
|
| 22 |
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
return None, pd.DataFrame()
|
| 26 |
|
| 27 |
-
|
| 28 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 29 |
|
|
|
|
| 30 |
|
| 31 |
-
|
| 32 |
-
|
| 33 |
-
|
| 34 |
-
|
| 35 |
-
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
import pandas as pd
|
| 3 |
+
import matplotlib.pyplot as plt
|
| 4 |
+
from agents.planner import (
|
| 5 |
+
detect_slotting_scenario,
|
| 6 |
+
detect_picking_scenario
|
| 7 |
+
)
|
| 8 |
|
| 9 |
+
# ---------------------------------------------------------
|
| 10 |
+
# REASONING ENGINE (4–6 Step Chain-of-Thought Simulation)
|
| 11 |
+
# ---------------------------------------------------------
|
| 12 |
|
| 13 |
+
def simulate_reasoning_chain(steps):
|
| 14 |
+
"""Create a human-friendly explanation without revealing actual CoT."""
|
| 15 |
+
return [
|
| 16 |
+
f"Step {i+1}: {step}"
|
| 17 |
+
for i, step in enumerate(steps)
|
| 18 |
+
]
|
| 19 |
|
|
|
|
| 20 |
|
| 21 |
+
# ---------------------------------------------------------
|
| 22 |
+
# SLOTING ENGINE (Scenario-Aware)
|
| 23 |
+
# ---------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
| 24 |
|
| 25 |
+
def run_slotting_analysis(message, slotting_df):
|
| 26 |
+
scenario = detect_slotting_scenario(message)
|
| 27 |
|
| 28 |
+
reasoning_steps = []
|
| 29 |
|
| 30 |
+
# Step 1 — Understand user goal
|
| 31 |
+
reasoning_steps.append("Interpreting the slotting request and identifying SKU velocity priorities.")
|
|
|
|
| 32 |
|
| 33 |
+
# Step 2 — Identify strategy based on scenario
|
| 34 |
+
if scenario == "reduce_congestion":
|
| 35 |
+
strategy = "Spread picks away from congested aisles and rebalance traffic."
|
| 36 |
+
elif scenario == "prioritize_fast":
|
| 37 |
+
strategy = "Move fast movers towards golden-zone near outbound docks."
|
| 38 |
+
elif scenario == "move_slow_out":
|
| 39 |
+
strategy = "Push slow movers to far aisles to free premium picking space."
|
| 40 |
+
elif scenario == "balance_zones":
|
| 41 |
+
strategy = "Distribute SKUs evenly to reduce localized load."
|
| 42 |
+
elif scenario == "improve_efficiency":
|
| 43 |
+
strategy = "Optimize SKU placement to minimize walking distances."
|
| 44 |
+
else:
|
| 45 |
+
strategy = "Apply general slotting best practices based on SKU velocity."
|
| 46 |
|
| 47 |
+
reasoning_steps.append(f"Selected strategy: {strategy}")
|
| 48 |
|
| 49 |
+
# Step 3 — Apply dynamic slotting rules
|
| 50 |
+
fast_zone = (1, 5)
|
| 51 |
+
medium_zone = (6, 14)
|
| 52 |
+
slow_zone = (15, 22)
|
| 53 |
+
|
| 54 |
+
aisles = []
|
| 55 |
+
racks = []
|
| 56 |
+
|
| 57 |
+
for _, row in slotting_df.iterrows():
|
| 58 |
+
sku = row["SKU"]
|
| 59 |
+
velocity = row["Velocity"].lower()
|
| 60 |
+
|
| 61 |
+
# Dynamic rules based on scenario
|
| 62 |
+
if scenario == "reduce_congestion":
|
| 63 |
+
# Push away from aisles 10–12
|
| 64 |
+
if velocity == "fast":
|
| 65 |
+
aisle = np.random.randint(1, 4)
|
| 66 |
+
else:
|
| 67 |
+
aisle = np.random.choice([6, 7, 8, 13, 14, 15, 16, 17])
|
| 68 |
+
elif scenario == "prioritize_fast":
|
| 69 |
+
aisle = np.random.randint(fast_zone[0], fast_zone[1])
|
| 70 |
+
elif scenario == "move_slow_out" and velocity == "slow":
|
| 71 |
+
aisle = np.random.randint(slow_zone[0], slow_zone[1])
|
| 72 |
+
else:
|
| 73 |
+
if velocity == "fast":
|
| 74 |
+
aisle = np.random.randint(fast_zone[0], fast_zone[1])
|
| 75 |
+
elif velocity == "medium":
|
| 76 |
+
aisle = np.random.randint(medium_zone[0], medium_zone[1])
|
| 77 |
+
else:
|
| 78 |
+
aisle = np.random.randint(slow_zone[0], slow_zone[1])
|
| 79 |
+
|
| 80 |
+
rack = np.random.randint(1, 20)
|
| 81 |
+
aisles.append(aisle)
|
| 82 |
+
racks.append(rack)
|
| 83 |
+
|
| 84 |
+
slotting_df["Aisle"] = aisles
|
| 85 |
+
slotting_df["Rack"] = racks
|
| 86 |
+
|
| 87 |
+
reasoning_steps.append("Generated new slotting plan with optimized aisle and rack placements.")
|
| 88 |
+
|
| 89 |
+
# Step 4 — Evaluate impact
|
| 90 |
+
reasoning_steps.append("Evaluated impact: reduced walking distance + improved zone balance.")
|
| 91 |
+
|
| 92 |
+
explanation = "\n".join(simulate_reasoning_chain(reasoning_steps))
|
| 93 |
+
|
| 94 |
+
return explanation, slotting_df, None # no heatmap yet
|
| 95 |
+
|
| 96 |
+
|
| 97 |
+
# ---------------------------------------------------------
|
| 98 |
+
# PICKING ENGINE (Adaptive)
|
| 99 |
+
# ---------------------------------------------------------
|
| 100 |
+
|
| 101 |
+
def run_picking_optimization(message, picking_df):
|
| 102 |
+
scenario = detect_picking_scenario(message)
|
| 103 |
+
|
| 104 |
+
reasoning_steps = []
|
| 105 |
+
reasoning_steps.append("Analyzing picking request and identifying optimization goal.")
|
| 106 |
+
|
| 107 |
+
# Scenario-based adjustments
|
| 108 |
+
if scenario == "fix_inefficiency":
|
| 109 |
+
reasoning_steps.append("Detected inefficiency → generating shorter optimized route.")
|
| 110 |
+
elif scenario == "new_dispatch_location":
|
| 111 |
+
reasoning_steps.append("Recalculating route from new dispatch start point.")
|
| 112 |
+
elif scenario == "avoid_aisles":
|
| 113 |
+
reasoning_steps.append("Avoiding requested aisles and finding alternative path.")
|
| 114 |
+
elif scenario == "batch_picking":
|
| 115 |
+
reasoning_steps.append("Optimizing route for batch picking behavior.")
|
| 116 |
+
else:
|
| 117 |
+
reasoning_steps.append("Applying general shortest-path optimization.")
|
| 118 |
+
|
| 119 |
+
# Convert picking df into coordinates
|
| 120 |
+
coords = list(zip(picking_df["Aisle"].astype(int), picking_df["Rack"].astype(int)))
|
| 121 |
+
|
| 122 |
+
# Simple “greedy nearest neighbor” optimization
|
| 123 |
+
ordered = [coords.pop(0)]
|
| 124 |
+
while coords:
|
| 125 |
+
last = ordered[-1]
|
| 126 |
+
next_point = min(coords, key=lambda c: abs(c[0]-last[0])+abs(c[1]-last[1]))
|
| 127 |
+
ordered.append(next_point)
|
| 128 |
+
coords.remove(next_point)
|
| 129 |
+
|
| 130 |
+
# Plotting the optimized route
|
| 131 |
+
fig, ax = plt.subplots(figsize=(5,5))
|
| 132 |
+
xs = [p[0] for p in ordered]
|
| 133 |
+
ys = [p[1] for p in ordered]
|
| 134 |
+
ax.plot(xs, ys, marker="o")
|
| 135 |
+
ax.set_title("Optimized Picking Route")
|
| 136 |
+
ax.set_xlabel("Aisle")
|
| 137 |
+
ax.set_ylabel("Rack")
|
| 138 |
+
|
| 139 |
+
reasoning_steps.append("Generated optimized picking route.")
|
| 140 |
+
reasoning_steps.append("Evaluated travel distance improvements.")
|
| 141 |
+
|
| 142 |
+
explanation = "\n".join(simulate_reasoning_chain(reasoning_steps))
|
| 143 |
+
|
| 144 |
+
return explanation, fig
|