Solving the Balanced Academic Curriculum Problem Using the ACO Metaheuristic

Algorithm 1

Bwas_bacp (instance 𝐼: a BACP instance).

(1) 𝜏_𝑜 ← InitialSolution(𝐼)

(2)  initializePheromoneTrails(𝜏_𝑜)

(3)  while (term criterion not satisfied) do

(4)    for  𝑖=1 to 𝑘  do

(5)   for  𝑗=1 to numCourses do

(6)    period ←transitionRule(𝑗)

(7)    assignCourse(𝑗, period)

(8)     end for

(9)    deposition(𝑄(𝑆_𝑖))

(10)    end for

(11)   evaporation()

(12)   currentBest ←selectBestSolutionIt(𝐴_𝑘)

(13)   localSearch(currentBest)

(14)    if   (best(currentBest, globalBest)) then

(15)   globalBest ←currentBest

(16)    end if

(17)   depositBestAnt(globalBest)

(18)   currentWorst ←selectWorstSolution(𝐴_𝑘)

(19)   evaporateWorstAnt(currentWorst)

(20)   mutation()

(21)  if   (stagnationcondition) then

(22)   reinitializePheromoneTrails()

(23)    end if

(24)   end while