03 · Improve a fixed assignmentILP: express feasible choices · LNS: reoptimize a selected part
X₀A→P · B→QGains (12, 2)Minimum 2t=0t=1t=2t=3t=4t=5t=6t=7t=8AhLPPPPPPPBB₀B₀v4v3v2v1hRQ
Keep A’s route · remove B’s extra wait at B₀
XA→P · B→QGains (12, 3)Minimum 3t=0t=1t=2t=3t=4t=5t=6t=7t=8AhLPPPPPPPBB₀v4v3v2v1hRQQ
04 · Try another assignmentA→Q · B→P: solve for another assignment
YA→Q · B→PGains (8, 7)Minimum 7t=0t=1t=2t=3t=4t=5t=6t=7t=8AhRQQQQQQQBB₀v4v3v2v1hLPP
Illustrative example · highlighted cells mark arrival or the extra wait. Every schedule uses the same graph and cost rule.