Planning personnel retraining: column generation heuristics
Retraining of staff is a compulsory managerial function in many organisations and often requires planning for a large number of employees. The large scale of this problem and various restrictions on the resultant assignment to classes make this planning challenging. The paper presents a complexity analysis of this problem together with linear and nonlinear mathematical programming formulations. Three different column generation based optimisation procedures and a large neighbourhood search procedure, incorporating column generation, are compared by means of computational experiments. The experiments used data typical to large electricity distributors.
KeywordsPersonnel retraining Column generation Integer programming Heuristic Large neighbourhood search
- Blte A, Thonemann UW (1996) Optimizing simulated annealing schedules with genetic programming. Eur J Oper Res 92(2):402–416. https://doi.org/10.1016/0377-2217(94)00350-5. http://www.sciencedirect.com/science/article/pii/0377221794003505
- Cornuéjols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Carnegie-mellon univ pittsburgh pa management sciences research group, Tech. repGoogle Scholar
- Hiley A, Julstrom BA (2006) The quadratic multiple knapsack problem and three heuristic approaches to it. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, pp 547–552Google Scholar
- Julstrom BA (2005) Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. In: Proceedings of the 7th annual conference on genetic and evolutionary computation. ACM, pp 607–614Google Scholar
- Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: International conference on principles and practice of constraint programming. Springer, pp 417–431Google Scholar