Genetic algorithm with greedy heuristic for capacity planning

A problem of optimal capacity planning of the process production lines (foundry for example) in accordance with a given output plan is considered as a discrete location problem on a network. The problem takes into account the terms of output plan completion for each kind of product and constraints of distribution uniformity of the total daily volume of production. For solving the problem, we use the genetic algorithm with greedy heuristics based on a similar algorithm for the p-median problem. Solving example problems demonstrates the efficiency of the algorithm.