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

Algorithm 1

Generation of all valid potential duties.

(1) Given a bus schedule, a maximum working time of duty , and a required number of pieces ; Set

(2) for all bus vehicles do

(3) Select the relief opportunities to generate a set of piece of work

(4) Find the piece such that the length is shortest (denoted as ) in

(5) Compute a maximum number of piece

(6) end for

(7) whiledo

(8) for piece of work do

(9) for piece of work do

(10) ⋯

(11) for piece of work do

(12) if Duty which covers () satisfies the constrains (9)–(13) then

(13) Add generated duty to set of duties

(14) ++++

(15) end if

(16) end for

(17) end for

(18) end for

(19) end while1111eq:eps

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19.