{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:23:21Z","timestamp":1777706601424,"version":"3.51.4"},"reference-count":16,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:p>The Student-Project Allocation with preferences over Projects problem is a many-to-one stable matching problem that aims to assign students to projects in project-based courses so that students and lecturers meet their preference and capacity constraints. In this paper, we propose an efficient two-heuristic algorithm to solve this problem. Our algorithm starts from an empty matching and iteratively constructs a maximum stable matching of students to projects. At each iteration, our algorithm finds an unassigned student and assigns her\/his most preferred project to her\/him to form a student-project pair in the matching. If the project or the lecturer who offered the project is over-subscribed, our algorithm uses two heuristic functions, one for the over-subscribed project and the other for the over-subscribed lecturer, to remove a student-project pair in the matching. To reach a stable matching of a maximum size, our two heuristics are designed such that the removed student has the most opportunities to be assigned to some project in the next iterations. Experimental results show that our algorithm is efficient in execution time and solution quality for solving the problem.<\/jats:p>","DOI":"10.3233\/jifs-236300","type":"journal-article","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T12:00:07Z","timestamp":1711108807000},"page":"140-152","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient two-heuristic algorithm for the student-project allocation with preferences over projects"],"prefix":"10.1177","volume":"49","author":[{"given":"Hoang Huu","family":"Viet","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Vinh University, Nghe An, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Thi","family":"Uyen","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Vinh University, Nghe An, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Thanh","family":"Cao","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Vinh University, Nghe An, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long Giang","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Institute of Information Technology, Vietnam Academy of Science and Technology, Hanoi, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"e_1_3_1_2_1","unstructured":"AbrahamD.J.IrvingR.W.ManloveD.F. The studentproject allocation problem. In Proceedings of the 14th International Symposium on Algorithms and Computation (2003) pp. 474\u2013484 Kyoto Japan."},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.03.006"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2710-1"},{"key":"e_1_3_1_5_1","unstructured":"CooperF.ManloveD. A 3\/2-approximation algorithm for the student-project allocation problem. In Proceedings of the 17th International Symposium on Experimental Algorithms (2018) pp. 8:1\u20138:13 L\u2019Aquila Italy."},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.02.001"},{"key":"e_1_3_1_8_1","unstructured":"KazakovD. Co-ordination of student-project allocation. Manuscript University of York Department of Computer Science http:\/\/www-users.cs.york.ac.uk\/kazakov\/papers\/proj.pdf 2001."},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9371-7"},{"key":"e_1_3_1_10_1","doi-asserted-by":"crossref","unstructured":"KwanashieA.IrvingR.W.ManloveD.F.SngC.T.S. Profile-based optimal matchings in the student\/project allocation problem. In Proceedings of the 25th International Workshop on Combinatorial Algorithms (2014) pp. 213\u2013225 Duluth USA.","DOI":"10.1007\/978-3-319-19315-1_19"},{"key":"e_1_3_1_11_1","doi-asserted-by":"crossref","unstructured":"ManloveD.MilneD.OlaosebikanS. An integer programming approach to the student-project allocation problem with preferences over projects. In Proceedings of the 5th International Symposium on Combinatorial Optimization (2018) pp. 313\u2013325 Morocco.","DOI":"10.1007\/978-3-319-96151-4_27"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.08.015"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.07.003"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00632-x"},{"key":"e_1_3_1_16_1","unstructured":"RusselS.NorvigP. Artificial Intelligence: A Modern Approach. Prentice Hall Press Upper Saddle River NJ USA 3rd edition 2009."},{"key":"e_1_3_1_17_1","doi-asserted-by":"crossref","unstructured":"VietH.H.Van TanL.Thanh CaoS. Finding maximum stable matchings for the student-project allocation problem with preferences over projects. In Proceedings of the 7th International Conference on Future Data and Security Engineering (2020) pp. 411\u2013422 Quy Nhon Vietnam.","DOI":"10.1007\/978-981-33-4370-2_29"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-236300","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-236300","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-236300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:47:17Z","timestamp":1777456037000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-236300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["10.3233\/JIFS-236300"],"URL":"https:\/\/doi.org\/10.3233\/jifs-236300","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]}}}