Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Algorithm 3

Clustering.

Input:  : population;

 ; maximum number of chromosomes;

Output:  : population with exactly chromosomes;

 {calculate the crowding distance for each element/chromosome in

 crowdingDistance()

 {sort the elements in ascending order}

 sort()

 {choose the biggest elements according to the crowding distance}

  elements of with the biggest crowding distances

 return