Help me find algorithm so solve this problem

See more:

C++

C

Java

architecture

algorithm

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.