A Max-Min Ant System for Research Topic Selction in Academia
- Articles
- Submited: July 26, 2021
-
Published: July 29, 2021
Abstract
University professors all over the world are facing an increasing challenges to publish more and more high-quality papers, get funds, and improve their citation indices. In many scientific disciplines, like engineering and computer science, research topics keep changing and professors’ research agendas need to change as well. In this paper, we develop a mixed-integer linear program (MILP) to model a university professor problem of selecting research topics. The problem aims to increase the professor’s number of citations subject to time constraint and publication probability constraint. We also solve the suggested MILP using a max-min ant system. A case study for a professor in an industrial engineering department is also presented.
Article Metrics Graph
References
[1] Nakhaie, M. R. (2007). Universalism, ascription and academic rank: Canadian professors, 1987–2000. Canadian Review of Sociology/Revue canadienne de sociologie, 44(3), 361-386. https://doi.org/10.1111/j.1755-618X.2007.tb01190.x
[2] Parker, J. (2008). Comparing research and teaching in university promotion criteria. Higher education quarterly, 62(3), 237-251.
https://doi.org/10.1111/j.1468-2273.2008.00393.x
[3] Cadez, S., Dimovski, V., & Zaman Groff, M. (2017). Research, teaching and performance evaluation in academia: the salience of quality. Studies in Higher Education, 42(8), 1455-1473.
https://doi.org/10.1080/03075079.2015.1104659
[4] Yelle, L. E. (1979). The learning curve: Historical review and comprehensive survey. Decision sciences, 10(2), 302-328.
https://doi.org/10.1111/j.1540-5915.1979.tb00026.x
[5] Stützle, T., & Hoos, H. H. (2000). MAX–MIN ant system. Future generation computer systems, 16(8), 889-914.
https://doi.org/10.1016/S0167-739X(00)00043-1
[6] Al-Shihabi, S. (2004, September). Backtracking ant system for the traveling salesman problem. In International Workshop on Ant Colony Optimization and Swarm Intelligence (pp. 318-325). Springer, Berlin, Heidelberg.
Backtracking Ant System for the Traveling Salesman Problem | SpringerLink
[7] Al-Shihabi, S. (2004, August). Ants for Sampling in the Nested Partition Algorithm. In Hybrid Metaheuristics (pp. 11-18).
Al-Shihabi, S.: Ants for sampling in the nested partition... - Google Scholar
[8] Mandahawi, N., Al-Shihabi, S., & Altarazi, S. (2011). A max-min ant system to minimize total tardiness on a single machine with sequence dependent setup times implementing a limited budget local search. International Journal of Research and Reviews in Applied Sciences, 6(1), 30-40.
1 (arpapress.com)
[9] Al-Shihabi, S. (2016). A hybrid of max–min ant system and linear programming for the k-covering problem. Computers & Operations Research, 76, 1-11.
https://doi.org/10.1016/j.cor.2016.06.006
[2] Parker, J. (2008). Comparing research and teaching in university promotion criteria. Higher education quarterly, 62(3), 237-251.
https://doi.org/10.1111/j.1468-2273.2008.00393.x
[3] Cadez, S., Dimovski, V., & Zaman Groff, M. (2017). Research, teaching and performance evaluation in academia: the salience of quality. Studies in Higher Education, 42(8), 1455-1473.
https://doi.org/10.1080/03075079.2015.1104659
[4] Yelle, L. E. (1979). The learning curve: Historical review and comprehensive survey. Decision sciences, 10(2), 302-328.
https://doi.org/10.1111/j.1540-5915.1979.tb00026.x
[5] Stützle, T., & Hoos, H. H. (2000). MAX–MIN ant system. Future generation computer systems, 16(8), 889-914.
https://doi.org/10.1016/S0167-739X(00)00043-1
[6] Al-Shihabi, S. (2004, September). Backtracking ant system for the traveling salesman problem. In International Workshop on Ant Colony Optimization and Swarm Intelligence (pp. 318-325). Springer, Berlin, Heidelberg.
Backtracking Ant System for the Traveling Salesman Problem | SpringerLink
[7] Al-Shihabi, S. (2004, August). Ants for Sampling in the Nested Partition Algorithm. In Hybrid Metaheuristics (pp. 11-18).
Al-Shihabi, S.: Ants for sampling in the nested partition... - Google Scholar
[8] Mandahawi, N., Al-Shihabi, S., & Altarazi, S. (2011). A max-min ant system to minimize total tardiness on a single machine with sequence dependent setup times implementing a limited budget local search. International Journal of Research and Reviews in Applied Sciences, 6(1), 30-40.
1 (arpapress.com)
[9] Al-Shihabi, S. (2016). A hybrid of max–min ant system and linear programming for the k-covering problem. Computers & Operations Research, 76, 1-11.
https://doi.org/10.1016/j.cor.2016.06.006
How to Cite
1.
A Max-Min Ant System for Research Topic Selction in Academia . Journal of Research and Opinion [Internet]. 2021 Jul. 29 [cited 2024 Nov. 25];8(7):2995-8. Available from: https://researchopinion.in/index.php/jro/article/view/117
