Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports

Algorithm 1

DE.

Step  1:  Initialize a population of individuals;

Step  2:  Evaluate the individuals and record the current best solution;

Step  3: While the preset stopping condition is not satisfied DO

     Step  3.1: Mutation Generate a mutant population by using a mutation operator;

     Step  3.2: Crossover Mix the parent and mutant to create a trial population;

     Step  3.3: Selection Select the survival of the fitter for the next generation;

    End

Step  4:  Return the best solution.