Computational geometry: an introduction
Computational geometry: an introduction
A Minimax Planar Location Problem with Forbidden Zones: Its Solution Algorithm
Automation and Remote Control
Constrained location of competitive facilities in the plane
Computers and Operations Research
Model building and location problem solving in a plane with forbidden gaps
Automation and Remote Control
| Hi-index | 0.00 |
There are a lot of fixed objects and rectangular forbidden zones on the plane. It is necessary to arrange on this plane, outside of forbidden zones, objects connected with fixed objects and among themselves. The rectangular metric is used for the measurement of distances. The optimality criterion in the problem is the minimality of the total cost of connections among all objects. The problem property is found that makes it possible to reduce the considered admissible region in the search for the optimal solution. The results of the computational experiment for analysis of the application effectiveness of the stated property are presented.