Algorithm 2. The pseudo-code of the proposed ABC-CA model

Input datasets Initialize the ABC algorithm configurations Set Cycle = 1 Repeat until Cycle ≤ the maximum iteration number  Initialize transition rules using worker bees based on lower and upper threshold values for every variable  Calculate conversion potential value (cell status) based on LR and transition rules in CA mechanism  Produce new lower and upper threshold values for new rule construction by the worker bees using Equation (7)  Apply the greedy selection process to select worker bees for achieving new lower and upper threshold values  Calculate the probability values $p_i$ using Equations (8) and (9)  If $p_i$ > rand(0,1), then   Produce new lower and upper threshold values for onlooker bees using Equation (7)   Apply the greedy selection process to select onlooker bees for achieving new lower and upper threshold values  End if  Determine the lower and upper threshold values, if they exist  Replace it with a new randomly produced position (the lower and upper threshold values) for the scout using Equation (7)  Record current best (the lower and upper threshold values) and construct current best rule  Calculate conversion potential value based on LR and transition rules in CA mechanism  Produce the simulated land use map and Compare it with actual land use map  Cycle = Cycle + 1 End repeat