HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem

Figure 1

Probability distribution of the time required to reach the value of the objective function. (a) Instance: RanReal240_05 and target:193000. (b) Instance: RanReal240_09 and target: 207700. (c) Instance: RanReal240_16 and target: 202000. (d) Instance: RanReal480_05 and target: 473000. (e) Instance: RanReal480_14 and target: 500. (f) Instance: RanReal480_18 and target: 515000. (g) Instance: RanReal960_02.30 and target: 1380000. (h) Instance: RanReal960_06.30 and target: 1370000. (i) Instance: RanReal960_07.40 and target: 1000000. (j) Instance: RanReal960_05.60 and target: 710000. (k) Instance: MDG-a_23 and target: 360000. (l) Instance: MDG-a_35 and target: 330000.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

(h)

(i)

(j)

(k)

(l)