Research Article
A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems
Algorithm 3
K-means transition algorithm.
1: Function K-meansTransition(ListX (t)) | 2: Input List solutions t (ListX (t)) | 3: Output List solution t + 1 (ListX (t + 1)) | 4: ∆i List ← get∆i (ListX (t), MH) | 5: Xi Groups ← K-means (∆i List, K) | 6: forX(t) in ListX (t) | 7: forXi (t) in X(t) | 8: Xi Groups ← get Xi Groups (i, X(t), Xi Groups) | 9: getTransitionProbability(Xi Group) | 10: applyTransitionRule() | 11: end for | 12: end for | 13: for in | 14: Repair() | 15: end for | 16: return |
|