A Hybrid Metaheuristic of Integrating Estimation of Distribution Algorithm with Tabu Search for the Max-Mean Dispersion Problem

Algorithm 1

Main scheme of the EDA-TS algorithm.

(1) Input: a distance matrix

(2) Output: The best solution

(3) EliteSetInitialization() (see Section 2.2)

(4) Record the best solution in

(5) CPPM CPPMatrixCalculation(ES) (see Section 2.3.1)

(6) while the elapsed time does not surpass the given time limit do

(7)  EDAGuidedSolutionConstruction(, ) (see Section 2.3.2)

(8)  TabuSearch() (see Section 2.4)

(9) if then

(10)  

(11) end if

(12) Find the solution getting the worst objective value in

(13) () EliteSetUpdating() (see Section 2.5)

(14) if then

(15)  

(16) else

(17)  

(18) end if

(19) if then

(20)   EliteSetRebuilding() (see Section 2.5)

(21) end if

(22) if undergoes updates for times then

(23)   CPPMatrixCalculation() (see Section 2.3.1)

(24) end if

(25) end while