Simple
Plant Location Problem
Benchmarks 
Simple
Plant Location Problem
Benchmarks
Instances on the Perfect Codes
Allocation of
local optima
We get 8868 local optima with respect to the neighborhood Add-Drop-Swap for 9000 random subsets of the set I . On the diagram every sphere corresponds to a local optimum. The sphere radius is number of local optima which situated not far from the distance 10. The minimal radius is 1, the maximal one is 57, average one is 3. Radius of the sphere for the global optimum is 52. The value of objective function for the global optimum is 48227. We get other 10 local optima with value less than 49000 in spite of it is known that are exactly 240 such local optima in this instance. For each code there are 7 other codes pairwise disjoint with him and mutual distance from one to another is 32. Moreover, the minimum distance between codes no less than 4. Maximal distance between all local optima is 55.
Abscissa axis is Hamming distance to the global optimum.
Axis of ordinates is the value of the objective function.
Instance code is 534.