A Column Generation Based Hyper-Heuristic to the Bus Driver Scheduling Problem

Algorithm 3

Local search.

(1) Determine properties of each duty: number of spells, duty type and cost.

(2) Construct different neighborhood structures.

(3) Begin with one neighborhood structure which is randomly selected to search.

(4) while countmove < Maxumummove do

(5)  Candidate duty is chosen randomly in

(6)  

(7)   Apply 2-exchange

(8)  if current duty is better than incumbent then

(9)   

(10)  end if

(11)  countmove++

(12) end while

(13) Add to RMP if it has a negative reduced cost