Shared Mechanism-Based Self-Adaptive Hyperheuristic for Regional Low-Carbon Location-Routing Problem with Time Windows

Algorithm 2

Pseudocode of high-level selection strategy.

op is operator of the last iteration; nop is current selected operator;

FIRop is the fitness improvement rate obtained by op; Tmax and t

is the maximum/current iteration, et al.

input: op, FIRop, TQ, bf, bf⁰

output: nop

// Classification

GFIRop=GFIRop+FIRop

i=0

while i≤TN do

if GFIR_i<0 then

Partition.Operator (i) into PH

else

Partition.Operator (i) into EH

end if

end while

// Type of Selction(PH/EH)

FRR=Algorithm. Implement (1)

p_ph=Probability.Calculation (TQ, TN)

if p_ph>rand then

Reward_op=Reward. Calculation(op, t, , bf, bf⁰)

PFIRop=PFIRop+Reward_op

TotalReward=∑ PFIR.

for op=0 to NT do

FRR_op=PFIR_op/TotalReward

end for

end if

// Credit Value Calculation

for i=0 to Size of the EH or PH do

op=EH/PH. getOperator(i)

CV_op=CreditValue.Calculation (FRR_op, N) % Equitation (30)

end

// Roulette Selection

nop=Roulette. Selection (CV, EH/PH)