Experimental Results.xlsx

In this section, we will evaluate the performance of the algorithm A-ABC. CPLEX is employed to directlysolve the relaxation model [OP2]. The A-ABC heuristic algorithm is configured with <i>t </i>= 100 iterations and thesolver is set to solve within 3600 seconds. Table 3 illustrates the average outcomes achieved by both CPLEXand A-ABC across instances involving 6, 9, and 25 clients. The table outlines specifics such as the number ofregions (<i>N</i>), instance count (#), instances optimally solved (#O), lower bound (<i>lb</i>, which represents the best?found target value), upper bound (<i>ub</i>), percentage gap calculated as (<i>ub</i>−<i>lb</i>)/<i>lb</i>×100%, and the Time (<i>s</i>) column,indicating the solver’s duration to establish the lower bound. Additionally, for A-ABC, we present the averagebest target value, average worst target value, average target value, standard deviation from 10 runs, average totalcomputation time (in seconds), and the Gap value derived from CPLEX. Table 4 distinctly emphasizes superiorvalues among diverse heuristic methods alongside their shortest computation times. Detailed solutions for eachinstance can be found in the online supplement.