Research Article
Joint Optimization of Item and Pod Storage Assignment Problems with Picking Aisles’ Workload Balance in Robotic Mobile Fulfillment Systems
| Require: P (population), N (population size), (set of orders) | (1) | Step 1: Construct an initial pod combination by the greedy strategy | (2) | for ( = 1; ; ++) do | (3) | while | (4) | ← Greedy_strategy (P, N) | (5) | end while | (6) | Step 2: Improve the solution | (7) | if () then | (8) | ← SwapPod () | (9) | ← DeletePod () | (10) | end if | (11) | end for |
|