Top

Journal of Combinatorial Optimization

Published in:

09-02-2018

Planning personnel retraining: column generation heuristics

Authors: Oliver G. Czibula, Hanyu Gu, Yakov Zinder

Published in: Journal of Combinatorial Optimization | Issue 3/2018

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

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.

previous article Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

next article An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

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

Caprara A, Pisinger D, Toth P (1999) Exact solution of the quadratic knapsack problem. INFORMS J Comput 11(2):125–137MathSciNetCrossRefMATH

Chen Y, Hao JK (2015) Iterated responsive threshold search for the quadratic multiple knapsack problem. Ann Oper Res 226:101–131MathSciNetCrossRefMATH

Chen Y, Hao JK, Glover F (2016) An evolutionary path relinking approach for the quadratic multiple knapsack problem. Knowl Based Syst 92:23–34CrossRef

Chopra S, Rao MR (1993) The partition problem. Math Program 59(1–3):87–115MathSciNetCrossRefMATH

Cornuéjols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Carnegie-mellon univ pittsburgh pa management sciences research group, Tech. rep

Desrosiers J, Lübbecke ME (2005) A primer in column generation. Springer, BerlinCrossRefMATH

Drezner Z (2003) A new genetic algorithm for the quadratic assignment problem. INFORMS J Comput 15(3):320–330. https://doi.org/10.1287/ijoc.15.3.320.16076. MathSciNetCrossRefMATH

García-Martínez C, Rodriguez F, Lozano M (2014) Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur J Oper Res 232:454–463MathSciNetCrossRefMATH

Garey MR, Johnson DS (1979) Computers and intractability: a guide to np-completeness. Freeman, San FranciscoMATH

Gintner V, Kliewer N, Suhl L (2005) Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice. OR Spectr. 27(4):507–523CrossRefMATH

Goldschmidt O, Hochbaum DS, Levin A, Olinick EV (2003) The sonet edge-partition problem. Networks 41(1):13–23MathSciNetCrossRefMATH

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–552

Johnson EL, Mehrotra A, Nemhauser GL (1993) Min-cut clustering. Math program 62(1–3):133–151MathSciNetCrossRefMATH

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–614

Pisinger D, Ropke S (2010) Large neighborhood search. In: Potvin J-Y, Gendreau M (eds) Handbook of metaheuristics. Springer, Boston, pp 399–419CrossRef

Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, BerlinMATH

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–431

Taşkın ZC, Smith JC, Ahmed S, Schaefer AJ (2009) Cutting plane algorithms for solving a stochastic edge-partition problem. Discrete Optim 6(4):420–435MathSciNetCrossRefMATH

Wang H, Kochenberger G, Glover F (2012) A computational study on the quadratic knapsack problem with multiple constraints. Comput Oper Res 39(1):3–11MathSciNetCrossRefMATH

Title: Planning personnel retraining: column generation heuristics
Authors: Oliver G. Czibula
Hanyu Gu
Yakov Zinder
Publication date: 09-02-2018
Publisher: Springer US
Published in: Journal of Combinatorial Optimization / Issue 3/2018
Print ISSN: 1382-6905
Electronic ISSN: 1573-2886
DOI: https://doi.org/10.1007/s10878-018-0253-2

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Other articles of this Issue 3/2018

Lot sizing with storage losses under demand uncertainty

On a general framework for network representability in discrete optimization

ILP formulation of the degree-constrained minimum spanning hierarchy problem

Optimization problems with color-induced budget constraints

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

An algorithm for finding a representation of a subtree distance

Premium Partner