A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems

Algorithm 1

Cuckoo search algorithm.

 Objective function: ,

 Generate an initial population of m host nests

 while (t<MaxGeneration) or (stop criterion)

  Get a cuckoo randomly (say, i) and replace its solution by performing Lévy flights

  Evaluate its fitness

  Choose a nest among n (say, j) randomly

  if < then

   Replace j by the new solution

  end if

  a fraction of the worse nests are abandoned and new ones are built

  Keep the best nests

  Rank the nests and find the current best

  Pass the current best solutions to the next generation

 end while