Optimization Approach for Yard Crane Scheduling Problem with Uncertain Parameters in Container Terminals
Algorithm 1
Algorithm of first come first served basis.
Input: information of tasks
(1)
Initialize the number of iterations:
(2)
The yard is divided into Y areas with similar number of tasks.
(3)
While , do:
(4)
(5)
The tasks in area are sorted in increase order of time, represented by . Calculate the schedule of yard crane and the objective value .
(6)
Generate the sequence of storage tasks in area according to the shortest distance, taking every half an hour for a period. Calculate the schedule of yard crane .
(7)
Insert the retrieval tasks in area one by one in order of their arrival time into the sequence . Calculate the schedule of new sequence and the objective value .
(8)
If , then
(9)
Optimal_
(10)
else
(11)
Optimal_
(12)
End if
(13)
Add the Optimal_i into the set of optimal solution.
