A swarm intelligence approach for the p-median problem

A Metaheuristic to Solve the Capacitated Clustering Problem

“…The ABC algorithm was originally proposed for multi-modal and multi-variable continuous optimisation problems and numerical optimisation problems [18]. Many variations of the ABC algorithm have later been practiced to many types of optimisation problems, like symbolic regressions [19], the quadratic minimum spanning tree problem [20], the design and operation of assembly lines [21], the leafconstrained minimum spanning tree problem [22], image segmentation [23], binary optimisation problems [24], recurrent neural network designs [25], constrained optimisation problems [26], the development of routing protocols for wireless sensor networks [27], [28], multi-objective optimisation problems [29], [30], as cited in [17], and the p-median problem [31], [32], uncapacitated facility location problems [33], [34], the knapsack problem (KP) [35], [36], the vehicle routing problem (VRP) [37], [38], the job shop scheduling problem (JSSP) [39], [40], the TSP [41], [42] and clustering problems [43], [44], [45], as cited in [46]. A complete review of the ABC algorithms and hybrid approaches and applications can be found in [47] and [48], and a comparative study between the ABC and the GA and PSO, as well as different evaluation algorithms can be found in [18].…”