ONE WAREHOUSE · TWO LEVELS OF SEARCH

01 · Define rewards and costsP:14 · Q:10 · 1/step

02 · Compare the lowest gainGain = reward − arrival cost

03 · Improve a fixed assignmentKeep X · improve its routes

04 · Try another assignmentConsider Y · solve its routes

Score updated routes

Allocate more computation

X₀ · B waits onceGains (12, 2) · minimum 2

X · remove that waitGains (12, 3) · minimum 3

Y · exchange the tasksGains (8, 7) · minimum 7

Illustrative candidate changes · 01–02 open the map and scoring rule; 03–04 open the exact candidate schedules.