Search of local minimum in location problem of rectangles on lines
The problem of optimum location of the interconnected facilities on parallel lines with the forbidden gaps is considered. Location in the forbidden gaps isn't allowed. The locating facilities are connected among themselves and with gaps. For measurement of distances the rectangular metrics is used. Criterion of optimization is minimization of total cost of communications of facilities among themselves and with gaps. The considered problem is model of many practical applications from various fields of science and design. The mathematical model of integer linear programming of search of a local optimum of the problem is constructed. The computing experiment with use of the offered model and an IBM ILOG CPLEXpackage is made.