Abstract
The classical generalized assignment problem (GAP) has applications that include resource allocation, staff and job scheduling, network routing, decision making and many others. In this paper, principles of three heuristics are identified. The detailed study on common algorithms like genetic algorithm, ant colony optimization, tabu search and their combinations is made and their performance for paper-reviewer assignment problem is evaluated. The computational experiments have shown that all selected algorithms have determined good results.
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
Preview
Unable to display preview. Download preview PDF.
References
Yagiura, M., Ibaraki, T.: Recent Metaheuristic Algorithms for the Generalized Assignment Problem. In: Int. Conf. on Informatics Research for Development of Knowledge Society Infrastructure, pp. 229–237. IEEE Press, Los Alamitos (2004)
Pentico, D.W.: Assignment problems: A golden anniversary survey. European J. of Operational Research 176, 774–793 (2007)
Garrett, D., Vannucci, J., Silva, R., Dasgupta, D., Simien, J.: Genetic algorithms for the sailor assignment problem. In: Conference on Genetic and Evolutionary Computation, pp. 1921–1928. ACM, New York (2005)
Randall, M.: Heuristics for ant colony optimisation using the generalised assignment problem. In: Congress on Evolutionary Comput., pp. 1916–1923. IEEE Press, Los Alamitos (2004)
Wu, T.H., Yeh, J.Y., Syau, Y.R.: A Tabu Search Approach to the Generalized Assignment Problem. J. of the Chinese Inst. of Industrial Eng. 21(3), 301–311 (2004)
Kolasa, T., Król, D.: ACO-GA approach to paper-reviewer assignment problem in CMS. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS, vol. 6071, pp. 360–369. Springer, Heidelberg (2010)
Kolasa, T., Król, D.: A Survey of Algorithms for Paper-Reviewer Assignment Problem. IETE Tech. Rev. 28 (2011) (in Press)
Feltl, H., Raidl, G.R.: An improved hybrid genetic algorithm for the generalized assignment problem. In: Symp. on Applied Computing, pp. 990–995. ACM, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kolasa, T., Król, D. (2011). A Performance Evaluation Study of Three Heuristics for Generalized Assignment Problem. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-19953-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19952-3
Online ISBN: 978-3-642-19953-0
eBook Packages: EngineeringEngineering (R0)