Research Article
Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem
| Input: : Actual solution/chromosome; | | Output: : Neighbor solution/chromosome; | | Copy chromosome into | | {Interchange the order of two vessels} | | Vessels and randomly chosen from | | Interchange position of and in | | {Change the buffer assigned after its departure} | | Randomly choose other vessel from | | | | if then | | | | else if then | | | | else | | if then | | {Decrease a 10% the buffer size} | | | | else | | {Increase a 10% the buffer size} | | | | end if | | end if | | if then | | {Change number of assigned QCs} | | | | end if | | return Neighbour chromosome/solution |
|
