For example, if the average number of locations per route is 7.5, the algorithm takes approximately 75 seconds to solve a 75-location problem on an IBM 360/67 and approximately 115 seconds to solve a ...

Zvi Drezner, The p-Centre Problem-Heuristic and Optimal Algorithms, The Journal of the Operational Research Society, Vol. 35, No. 8 (Aug., 1984), pp. 741-748 ...

For the routing, we have utilized a heuristic search algorithm which first, generates a number of full routing paths. For example it generates 500 full routing paths.