Abstract
The paper is concerned with the planning of training sessions in large organisations requiring periodic retraining of their staff. The allocation of students must take into account student preferences as well as the desired composition of study groups. The paper presents a bicriteria Quadratic Multiple Knapsack formulation of the considered practical problem, and a novel solution procedure based on Lagrangian relaxation. The paper presents the results of computational experiments aimed at testing the optimisation procedure on real world data originating from Australia’s largest electricity distributor. Results are compared and validated against a Genetic Algorithm based matheuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
All test cases and solution files are available on request.
References
Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11(2), 125–137 (1999)
Chen, Y., Hao, J.K.: Iterated responsive threshold search for the quadratic multiple knapsack problem. Ann. Oper. Res. 226, 101–131 (2015)
Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59(1–3), 87–115 (1993)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts. In: Proceedings of the twenty-fourth annual ACM Symposium on Theory of computing, pp. 241–251. ACM (1992)
Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manage. Sci. 50(12-supplement), 1861–1871 (2004)
García-Martínez, C., Rodriguez, F., Lozano, M.: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur. J. Oper. Res. 232, 454–463 (2014)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-completeness. W. H. Freeman and co., New York (1979)
Guignard, M.: Lagrangean relaxation. Top 11(2), 151–200 (2003)
Hiley, A., Julstrom, B.A.: The quadratic multiple knapsack problem and three heuristic approaches to it. In: Proceedings of the 8th Annual conference on Genetic and Evolutionary Computation, pp. 547–552. ACM (2006)
Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62(1–3), 133–151 (1993)
Julstrom, B.A.: Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 607–614. ACM (2005)
Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. (TOMACS) 8(1), 3–30 (1998)
Saraç, T., Sipahioglu, A.: A genetic algorithm for the quadratic multiple knapsack problem. In: Mele, F., Ramella, G., Santillo, S., Ventriglia, F. (eds.) BVAI 2007. LNCS, vol. 4729, pp. 490–498. Springer, Heidelberg (2007)
Singh, A., Baghel, A.S.: A new grouping genetic algorithm for the quadratic multiple knapsack problem. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 210–218. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Czibula, O.G., Gu, H., Zinder, Y. (2016). A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-30139-6_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30138-9
Online ISBN: 978-3-319-30139-6
eBook Packages: Computer ScienceComputer Science (R0)