Abstract
A new technique for solving the generalized assignment problem (GAP) is presented. In this technique the GAP model is relaxed into a transportation problem (TP). Relaxing the GAP model into a TP is not a new technique. What is new is the generation of cuts from the constraint violations and then solve as a single problem at every iteration. This has the advantage that combinatorial explosion which is a nuisance is suppressed at every stage. The cuts generated from the violations are added to the current linear programming simplex tableau and then we update the optimal solution. In this way there is no need to resolve the problem as was the case in the earlier versions of the branch and bound (BB) method for transportation problem.
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
References
Asahiro, Y., Ishibashi, M., Yamashita, M.: Independent and cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. 18(2), 129–141 (2003)
Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. 24, 17–23 (1997)
Laguna, M., Kelly, J.P., Conzalez-Velarde, J.L., Glover, F.F.: Tabu search for the generalized assignment problem. Eur. J. Oper. Res. 82, 176–189 (1995)
Martello, S., Toth, P.: An algorithm for the generalized assignment problem. In: Brans, J.P. (ed.) Operations Research 81, pp. 589–603. North-Holland, Amsterdam (1981)
Munapo, E.: A transportation branch and bound algorithm for solving the generalized assignment problem. In: Proceedings of 6th International Conference on Applied Operational Research, vol. 6, pp. 150–158 (2014)
Munapo, E., Lesaoana, M., Nyamugure, P., Kumar, S.: A transportation branch and bound algorithm for solving the generalized assignment problem. Int. J. Syst. Assur. Eng. Manag. 6(3), 217–223 (2015). https://doi.org/10.1007/s13198-015-0343-9
Munapo, E.: Transportation Based Approach for Solving the Generalized Assignment Problem. In: Vasant, P., Zelinka, I., Weber, G.-W. (eds.) ICO 2021. LNNS, vol. 371, pp. 513–524. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-93247-3_51
Munapo, E.: Branch cut and free algorithm for the general linear integer problem. In: Vasant P., Zelinka I., Weber GW. (eds.) Intelligent Computing and Optimization. ICO 2020. Advances in Intelligent Systems and Computing, vol 1324, pp. 491–505. Springer, Cham. (2021). https://doi.org/10.1007/978-3-030-68154-8_44
Nauss, R.M.: Solving the generalized assignment problem: an optimizing heuristic approach. INFORMS J. Comput. 15(3), 249–266 (2003)
Ross, G.T., Soland, R.M.: A branch and bound algorithm for the generalized assignment problem. Math. Program. 8, 91–103 (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Munapo, E., Tawanda, T., Nyamugure, P., Kumar, S. (2023). Solving the GAP by Cutting Its Relaxed Problem. In: Vasant, P., Weber, GW., Marmolejo-Saucedo, J.A., Munapo, E., Thomas, J.J. (eds) Intelligent Computing & Optimization. ICO 2022. Lecture Notes in Networks and Systems, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-031-19958-5_79
Download citation
DOI: https://doi.org/10.1007/978-3-031-19958-5_79
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19957-8
Online ISBN: 978-3-031-19958-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)