Bài báo khoa học

The problem of Student-Project Allocation with student-specific ties (SPA-ST) has attracted research attention because of its wide applications in allocating students to projects at many universities. So far, many methods have been proposed to solve the SPA-ST problem, such as approximation algorithms, integer programming models, and local search. However, the problem of finding a stable matching of maximum size (MAX- SPA-ST) is NP-hard. These methods have yet to reach the optimal solution quality and the execution time is still a bottleneck for large-scale MAX-SPA-ST problems. In this paper, we propose a new algorithm for solving the MAX-SPA-ST problem. Our algo- rithm designs two heuristic functions to improve solution quality and execution time. Experimental results on large randomly generated instances show that our algorithm is more efficient than existing methods in terms of execution time and solution quality.