Research Article
A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System
Pseudocode 1
Pseudocode of judgment rules and modified calculated method.
| CalculateSameShelf() /judge whether the shelf of the latest task in robot is the same as the new task j | | Get the latest task in robot | | IF AND / the two tasks have the same shelf and the shelf is used by j immediately after | | IF / is the predecessor task of in the same station | | IF / is the direct predecessor task of in the same station | | , , , | | RETURN TRUE | | ELSE / is the indirect predecessor task of in the same station | | Get the travel time that robot travel from the exit of current station to the entrance of the current station | | IF / the modified time of task j arrives at the station satisfies the constraint (8) (9) | | , , , | | RETURN TRUE | | ELSE / and are required by different stations | | Get the travel time that robot travel from the exit of the current station to the entrance of the target station | | IF is the first task in the station | | OR / the modified time of task j arrives at the station satisfies the constraint (8) (9) | | , , | | ( is the first task) or | | RETURN TRUE | | ELSE | | RETURN FALSE |
|
