1,846
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Dormitory Assignment Using a Genetic Algorithm

& ORCID Icon
Pages 2276-2297 | Received 09 Feb 2021, Accepted 20 Oct 2021, Published online: 08 Jan 2022

References

  • Abraham, D. J., P. Biró, and D. F. Manlove. 2005. Almost stable’ matchings in the roommates problem. Approximation and Online Algorithms Lecture Notes in Computer Science 3879:1–14.
  • Albalawi, F. O., and M. S. Maashi. 2021. Selection and optimization of software development life cycles using a genetic algorithm. Intelligent Automation & Soft Computing 28 (1):39–52. doi:https://doi.org/10.32604/iasc.2021.015657.
  • Alimudin, A., I. Winarno, and Y. Ishida. 2019. Defining network switch preference by network traffic using stable marriage problem. Paper presented at the 2019 International Electronics Symposium (IES), Surabaya, Indonesia, September 27-28.
  • Biró, P., E. Iñarra, and E. Molis. 2016. A new solution concept for the roommate problem: Q-stable matchings. Mathematical Social Sciences 79:74–82. doi:https://doi.org/10.1016/j.mathsocsci.2015.12.001.
  • Bristi, W. R., F. Chowdhury, and S. Sharmin. 2019. Stable matching between house owner and tenant for developing countries. Paper presented at the 2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), Kanpur, India, July 6-8.
  • Chang, -C.-C. (2019). Applying a genetic algorithm to dormitory assignment optimization. Master Thesis, National Kaohsiung Normal University, Kaohsiung, Taiwan.
  • Chen, R., M. Chen, and H. Yang. 2020. Dynamic physician-patient matching in the healthcare system. Paper presented at the 2020 42nd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC), Montreal, QC, Canada, July 20-24.
  • Eslami, H., and M. Afzali. 2007. Applying genetic algorithm for allocating students to the dormitory rooms. Iran Data Mining Conference, Tehran, Iran, November 20, 2007, 1–8.
  • Gale, D., and L. S. Shapley. 1962. College admissions and the stability of marriage. The American Mathematical Monthly 69 (1):9–15. doi:https://doi.org/10.1080/00029890.1962.11989827.
  • Irving, R. W. 1985. An efficient algorithm for the ‘stable roommates’ problem. Journal of Algorithms 6 (4):577–95. doi:https://doi.org/10.1016/0196-6774(85)90033-1.
  • Irving, R. W., and D. F. Manlove. 2002. The stable roommates problem with ties. Journal of Algorithms 43 (1):85–105. doi:https://doi.org/10.1006/jagm.2002.1219.
  • Iwama, K., and S. Miyazaki. 2008. A survey of the stable marriage problem and its variants. Paper presented at the International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), January 17-17.
  • Katarı́na, C., and S. Ferková. 2004. The stable crews problem. Discrete Applied Mathematics 140 (1–3):1–17. doi:https://doi.org/10.1016/j.dam.2003.05.003.
  • Le Hong, T., V. Hoang Huu, and T. Chung. 2016. Finding “optimal” stable marriages with ties via local search. Paper presented at the 2016 Eighth International Conference on Knowledge and Systems Engineering (KSE), Hanoi, Vietnam, October 6-8.
  • Madi, K., E. Paquet, and H. Kheddouci (2019). New graph distance based on stable marriage formulation for deformable 3D objects recognition. Paper presented at the 2019 IEEE/ACS 16th International Conference on Computer Systems and Applications (AICCSA), Abu Dhabi, UAE, November 3–7.
  • Meulbroek, D., D. Ferguson, M. Ohland, and F. Berry. 2019. Forming more effective teams using CATME teammaker and the gale-shapley algorithm. Paper presented at the 2019 IEEE Frontiers in Education Conference (FIE), October 16-19.
  • Nakamura, M., K. Onaga, S. Kyan, and M. Silva. 1995. Genetic algorithm for sex-fair stable marriage problem. Paper presented at the Proceedings of ISCAS’95 - International Symposium on Circuits and Systems, April-May 30-3.
  • Pittel, B. G., and R. W. Irving. 1994. An upper bound for the solvability probability of a random stable roommates instance. Random Structures and Algorithms 5 (3):465–86. doi:https://doi.org/10.1002/rsa.3240050307.
  • Ren, J., F. Xia, X. Chen, J. Liu, M. Hou, A. Shehzad, N. Sultanova, X. Kong, et al. 2021. Matching algorithms: fundamentals, applications and challenges. IEEE Transactions on Emerging Topics in Computational Intelligence. 5(3):332–50. doi:https://doi.org/10.1109/TETCI.2021.3067655.
  • Roth, A. E., T. Sönmez, and M. U. Ünver. 2005. Pairwise kidney exchange. Journal of Economic Theory 125 (2):151–88. doi:https://doi.org/10.1016/j.jet.2005.04.004.
  • Settanni, E. (2000). Improving dorm room assignments using simulated annealing, Master Thesis, The University of New Mexico.
  • Tan, J. J. M. 1990. A maximum stable matching for the roommates problem. Bit 30 (4):631–40. doi:https://doi.org/10.1007/BF01933211.
  • Trang, L. H., N. T. Hoa, T. V. Hoai, and H. H. Viet. 2019. Finding MAX-SMTI for stable marriage with ties and bounded preference lists. Paper presented at the 2019 International Conference on Advanced Computing and Applications (ACOMP), November 26-28.
  • Trung, N. T., and D. T. Anh. 2009. Comparing three improved variants of simulated annealing for optimizing dorm room assignments. 2009 IEEE-RIVF International Conference on Computing and Communication Technologies, Da Nang, Vietnam, 1–5.
  • Vien, N. A., and T. Chung. 2006. Multiobjective fitness functions for stable marriage problem using genetic algrithm. Paper presented at the 2006 SICE-ICASE International Joint Conference, Busan, Korea, October 18-21.
  • Wang, W.-F., Z.-L. Li, and Y. Ma. 2009. Application of backtracking algorithm in college dormitory assignment management. 2nd IEEE International Conference on Computer Science and Information Technology, Beijing, China, August 8-11, 2009, 272–74.
  • Xiao, Y., D. Niyato, K. Chen, and Z. Han. 2016. Enhance device-to-device communication with social awareness: A belief-based stable marriage game framework. IEEE Wireless Communications 23 (4):36–44. doi:https://doi.org/10.1109/MWC.2016.7553024.
  • Yu, Q., and X.-A. Sun. 2016. A research on the model of university apartment occupancy distribution based on the student preferences. International Conference on Logistics, Informatics and Service Sciences (LISS), Sydney, Australia, 24-27 July, 2016, 1–5.
  • Zayed, H. A. B., and M. S. Maashi. 2021. Optimizing the software testing problem using search-based software engineering techniques. Intelligent Automation & Soft Computing 29 (1):307–18. doi:https://doi.org/10.32604/iasc.2021.017239.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.