帮我找到算法，以解决这个问题 [英] Help me find algorithm so solve this problem

问题描述

请帮我解决这个问题。我找不到它的算法。如果可以，请给我Pseudocode。谢谢所有



在这个城市，[ai，aj]位置有n个客户，每个客户请求A [ai，aj]。超市的位置[bi，bj]的m超市是B [bi，bj]（m超市必须有能力为n个顾客服务，每个顾客只使用一个超市，他们总是使用那个超市，有链接it）。

如果在位置[ki，kj]添加k个新客户进入城市，超市仍然有足够的能力为所有客户服务，如果老客户与超市之间的链接不变？如果这些超级市场没有足够的服务能力，我们需要在城市中添加多少超级市场（允许更改旧客户和超市之间的链接）以及我们需要添加的超级市场数量是最小的。



我尝试了什么：



我尝试通过蚁群算法解决问题但我找不到问题的答案。

Please help me solve this problem. I can not find algorithm for it. If you can, please give me Pseudocode. Thanks all

In the city there are n customers in the position [ai, aj], each client requests A [ai, aj]. And m supermarket in position [b i, bj] with a capacity of supermarkets is B [b i, bj] (m supermarket must have ability to serve n customers, each customer just use only one supermarket and they always ues that supermarket, have link with it).
If add k new customers in the position [ki , kj] into the city, the supermarkets still have enough ability to serve all customers or not if the link between old customers with supermarkets constant? If these supermakets not enough ability to serve, how many supermaket we need to add into the city ( allowed to change the link between the old customers and the supermarkets) and the number of supermaket we need to add is the smallest.

What I have tried:

I try to solve the problem by Ant colony algorithm but I can not find the answer for problem.

推荐答案

这是旅行推销员问题。它没有明确的解决方案，但有一些方法。



仔细阅读维基文章并按照有趣的链接进行操作。 （我找到了一个）

That is the Travelling salesman problem. It has no clear solution, but some approaches.

Read carefully the wiki-article and follow the interesting links. (I found one)

这篇关于帮我找到算法，以解决这个问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！