Abstract
In this work we modelled and solved the assignment problem appearing in MIC’s paper review process using metaheuristic methods. Each given paper has to be reviewed by several different reviewers before being accepted for the conference. We implemented a memetic algorithm to solve that assignment problem and evaluated different model variants against their real world performance, using valuable feedback from many reviewers. While solutions generated by the solver alone already led to remarkable results compared to random solutions, making use of more expert knowledge throughout the solving process further improved solution quality. One way to achieve this was to fixate, prohibit or change solution parts manually and thus to iteratively build up a tuned solution
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amini, M. M.; Racer, M. (1995): “A hybrid heuristic for the generalized assignment problem”. In: European Journal of Operations Research 87 Heuristics: Theory & Applications. Kluwer Academic Publishers, Boston, USA, 343-348.
Baker, J.E. (1987): “Reducing Bias and Inefficiency in the Selection Algorithm”. In: Grefenstette, J.J.: Proceedings of the Second International Conference on Genetic Algorithms and their Application, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1987, 14-21.
Cattrysse, D.G.; Salomon, M.; Van Wassenhove, L.N. (1994): “A set partitioning heuristic for the generalized assignment problem”. In: European Journal of Operations Research 72, 167-174.
Chu, P.C.; Beasley, J.E. (1997): “A genetic algorithm for the generalized assignment problem”. Computational Operations Research 24, 17-23.
Edmonds, Jack; Karp, Richard M. (1972): “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems”. In: Journal of the Association for Computing Machinery, Vol.19, No.2, 248–264.
Goldfarb, Donald; Jin, Zhiying (1999): “A new scaling algorithm for the minimum cost network flow problem”. In: Operations Research Letters 25, Elsevier Science B.V., 205–211.
Korte, B.; Vygen, J. (2006): ”Combinatorial Optimization: Theory and Algorithms”. 3rd Edition, Springer, 191–214
Laguna, M.; Kelly, J.P.; González-Velarde, J.L.; Glover, F. (1995): “Tabu search for the multilevel generalized assignment problem”. European Journal of Operations Research 82, 176-189.
Lourenco, H.R.; Serra, D. (2002): “Adaptive search heuristics for the generalized assignment problem”. Mathware Soft Computing 9, 209-234.
Martello, S.; Toth, P. (1981): “An algorithm for the generalized assignment problem”. Proceedings of the Ninth IFORS Internat. Conf. on Operational Research. Hamburg, Germany. North–Holland, Amsterdam, The Netherlands, 589-603.
Moscato, P.; Cotta, C. (2003): “A Gentle Introduction To Memetic Algorithms”. In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 105–144.
Nauss, R.M. (2003):“‘Solving the generalized assignment problem: An optimizing and heuristic approach”’. INFORMS Journal on Computing 15, 249-266.
Orlin, J.B. (1993): “A faster strongly polynomial minimum cost flow algorithm”. In: Operations Research, Vol.41,Issue 2, 338–350.
Osman, I.H. (1995): “Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches”. OR Spektrum 17, 211-225.
Resende, M.G.C.; Ribeiro, C.C. (2003): “Greedy Randomized Adaptive Search Procedures”. In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 219–249.
Savelsbergh, M.W.P. (1997): “A branch-and-price algorithm for the generalized assignment problem”. Operations Research 45, 831–841
Yagiura, M.; Ibaraki, T.; Glover, F. (2004): “An Ejection Chain Approach for the Generalized Assignment Problem”. In: INFORMS (INFORMS Journal of Computing , vol.16, no. 2), 133–151.
Yagiura, M.; Ibaraki, T.; Glover, F. (2006): “A Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem”. European Journal of Operational Research, 169, 548–569.
Yagiura, M.; Yamaguchi, T.; Ibaraki, T. (1999): “A variable depth search algorithm for the generalized assignment problem”. In: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, USA, 459–471.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Schirrer, A., Doerner, K.F., Hartl, R.F. (2007). Reviewer Assignment for Scientific Articles using Memetic Algorithms. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71921-4_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-71921-4_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71919-1
Online ISBN: 978-0-387-71921-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)