page loader
  1. Home
  2. Bài báo khoa học
  3. Chi tiết bài báo
An efficient algorithm to find a maximum weakly stable matching for SPA-ST problem
Authors: Nguyen Thi Uyen, Tran Xuan Sang
89    3
21st International Conference on Artificial Intelligence and Soft Computing
: 13589     : 356–366
: https://doi.org/10.1007/978-3-031-23480-4_30
: 1079_1079-14.pdf
Publishing year: 1/2023
This paper presents a heuristic algorithm to seek a maximum weakly stable matching for the Student-Project Allocation with lecturer preferences over Students containing Ties (SPA-ST) problem. We extend Gale-Shapley’s idea to find a stable matching and propose two new heuristic search strategies to improve the found stable matching in terms of maximum size. The experimental results show that our algorithm is more effective than AP in terms of solution quality and execution time for solving the MAX-SPA-ST problem of large sizes.
SPA · Heuristic Search · Weakly Stable Matching · MAXSPA-ST · Undominated Blocking Pairs.
International Journal of Advanced Research in Artificial Intelligence (IJARAI), 3(9), 2014.Vietnamese word segmentation based on the mutual information among the syllablesPath Finding Algorithms for Autonomous Robots Based on Reinforcement LearningActive teaching methods applied in training system towards CDIO educational frameworkPDCA cycle for higher education quality assessment and accreditationPREDICTING STUDENT'S ACADEMIC PERFORMANCE BY APPLYING DATA MINING TECHNIQUE.A Max-Min Conflict Algorithm for the Stable Marriage Problem A min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem withA max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists.Một thuật toán tìm kiếm cục bộ hiệu quả giải bài toán phân công địa điểm thực tập cho sinh viên An efficient heuristics algorithm for solving the Student-Project Allocation with Preferences over ProjectsA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsAn efficient algorithm to find a maximum weakly stable matching for SPA-ST problem Quantum Social Computing Approaches for Influence MaximizationA Heuristic Algorithm for Student-Project Allocation ProblemImproved Streaming Algorithm for Minimum Cost Submodular Cover ProblemAn efficient two-heuristic algorithm for the student-project allocation with preferences over projects