Hybrid algorithms with alternative embedded local search schemes for the p-median problem
2023, vol.15 , no.4, pp. 61-72
Progress in the development of location theory and clustering methods is mainly aimed at improving the performance of algorithms. We study the continuous p-median problem with the Euclidean metric. Various algorithmic combinations of the ALA procedure embedded into more sophisticated algorithmic combinations are used. Two repeated steps of the ALA algorithm solve the simplest discrete optimization problem, and then a series of central point search problems (Weber problem) for each cluster. A parallel implementation of the ALA algorithm is used. The paper studies the issue of choosing from two strategies: solve the Weber problem until accuracy ε is achieved at each iteration, or perform only one iteration of the Weiszfeld algorithm at each ALA iteration.
P-median problem, local search algorithms, Weber problem
Natalya Rezova , Lev Kazakovtsev , Ivan Rozhnov , Predrag S. Stanimirovic , Guzel Shkaberina. Hybrid algorithms with alternative embedded local search schemes for the p-median problem. International Journal on Information Technologies and Security, vol.15 , no.4, 2023, pp. 61-72. https://doi.org/10.59035/NTBO2860