A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System

Algorithm 1

The framework of the proposed algorithm.

Generate initial solutions using the serial scheduling generation scheme with the random activity selection rule

Select the best solutions with different auxiliary code into solutions pool

WHILE ()

Select pairs of solutions using the k-tournament method

Apply building-block based crossover and generate new solutions

Use the serial schedule generation scheme to generate schedules

Apply random-extract mutation to the new solutions and generate another new solutions

Use the serial schedule generation scheme to generate schedules

Add all the solutions together and select the best solutions with different auxiliary code into solutions pool

END WHILE

Output the best solution