A problem of optimal capacity planning of the production lines with a continuous manufacturing cycle (foundry for example) in accordance with a given product launch plan is considered as a discrete location problem on a network. For solving the problem, we use genetic algorithm with greedy heuristics based on an analogous algorithm for the p-median problem.
genetic algorithm, discrete location problem, operations scheduling, p-median problem
1. Frolov E. Operativnoe planirovanie proizvodstva // Direktor informacionnoy sluzhby. - 2013. -Vyp. 5. - URL: http://www.osp.ru/cio/2013/05/13035711/ (data obrascheniya: 01.10.2013).
2. Antamoshkin A., Masich I. Pseudo-Boolean Optimization in Case of an Unconnected Feasible Set, in: "Models and Algorithms for Global Optimization" // Optimization and Its Applications. - 2007. - V. 4. - P.111-122.
3. Kazakovtsev L.A., Gudyma M.N., Antamoshkin A.N. Genetic Algorithm with Greedy Heuristic for Capacity Planning // 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). - S.-Petersburg, 2014. - 6-8 October. - R. 607-613.
4. Avella P., Sassano A., Vasil’ev I. Computational Study of Large-Scale p-Median Problems // Mathematical Programming. - 2007. - Issue 109(1). - P. 89-114.
5. Antamoshkin A.N., Kazakovtsev L.A. Random Search Algorithm for the p-Median Problem // Informatica. -2013. - V. 37(3). - P. 267-278.
6. Alp O., Erkut E, Drezner Z. An Efficient Genetic Algorithm for the p-Median Problem // Annals of Operations Research. - 2003. - V.122(1-4). - P. 21-42.
