An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps

Resumo

Under study is the problem of optimal location of interconnected objects on a line with forbidden gaps. The task is to minimize the total cost of links between objects and between objects and zones. The properties of the problem are found that allowed us to reduce the initial continuous problem to a discrete problem. Some algorithm for obtaining an approximate solution is developed, and the results of a computational experiment are given.