UflLib
Euclidean Instances
Similar instances: k-median
These metric benchmarks were generated by Kochetov and Ivanenko [1]. In a square of length 7000 n points are chosen. Each point is a facility and a customer (n = m). Opening costs are equal to 3000 for each facility, connection costs are the distances in the Euclidean plane. Values are rounded to integers and satisfy the triangular inequality. For the present instances n was chosen to be 100.
More details are available at Sobolev Institute of Mathematics, where the instances are available for download in a different data format. The UflLib package contains the same instances in the simple data format.
References
| [1] |
Yu. Kochetov and D. Ivanenko. Computationally Difficult Instances for the Uncapacitated Facility Location Problem. In: T. Iberaki, K. Nonobe, Y. Musunori (eds.), Metaheuristics: Progress as Real Problem Solvers, Chapter 16, pp. 351-367, 2005. |