Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Algorithm 1

Implementation of MOGA + SA.

Input:  : instance of robust BAP + QCAP;

 : number of chromosomes;

 : number generations for local search

Output:  : set of nondominated schedules

 {Generate the parent population

  generateInitialPopulation(, )

 {Generate the offspring population

  evolvePopulation(, )

 while No termination criterion is satisfied do

    makeUnionSet(, )

    fastNondominatedSort()

    updateParetoFront()

   {Create the next parent population

   while    do

    {Add the th nondominated front () into the parent population

   end while

   if    then

    {Sort according to the crowding distance measure}

    crowdingDistance()

    sort()

    {Add the first elements of

    while    do

    end while

   end if

   {Use selection, crossover, and mutation to create a new population

    evolvePopulation(, )

   {Perform the local search each generations.}

   if    then

     mosa()

    {Assign the new Pareto front to

     clustering(, )

    {The new solutions found by the local search are kept in the population}

   end if

   {Increase the number of iterations}

end while

return Schedule of each element of the Pareto front