论文标题
逆连续设施位置问题的行生成方法问题
A row generation method for inverse continuous facility location problem
论文作者
论文摘要
在单个设施的位置问题中，给出了一组积分，目标是找到有关给定标准的最佳位置，例如最大程度地减少客户和设施之间的时间，成本和距离。另一方面，反向模型尝试用最低成本来修改问题的参数，以使给定点变得最佳。在本文中，我们引入了一种新型算法，用于逆单设施位置问题的一般情况，平面的权重可变。提出了算法的收敛性和最佳条件。然后，在特殊情况下，考虑了逆小型和最小单一设施位置问题，并在某些情况下测试了算法。结果表明算法在这些情况下的效率。
In a single facility location problem, a set of points is given and the goal is finding the optimal location of new facility respect to given criteria such as minimizing time, cost and distances between the clients and facilities. On the other side, the inverse models try to modify the parameters of the problem with the minimum cost such that a given point becomes optimal. In this paper, we introduce a novel algorithm for the general case of the inverse single facility location problem with variable weights in the plane. The convergence and optimality conditions of the algorithm are presented. Then in the special cases, the inverse minisum and minimax single facility location problems are considered and the algorithm tested on some instances. The results indicate the efficiency of the algorithm on these instances.
