Skip to main content
SpringerLink
Log in

An Efficient Algorithm to Find a Maximum Weakly Stable Matching for SPA-ST Problem

  • Conference paper
  • First Online:
Artificial Intelligence and Soft Computing (ICAISC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13589))

Included in the following conference series:

  • 310 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abraham, D., Irving, R., Manlove, D.: Two algorithms for the student-project allocation problem. J. Discret. Algorithms 5(1), 73–90 (2007)

    Article  MATH  Google Scholar 

  2. Aderant, F., Amosa, R., Oluwatobiloba, A.: Development of student project allocation system using matching algorithm. In: ICONSEET, vol. 1, pp. 153–160 (2016)

    Google Scholar 

  3. Binong, J.: Solving student project allocation with preference through weights. In: COMSYS, pp. 423–430 (2021)

    Google Scholar 

  4. Calvo-Serrano, R., Guillén-Gosálbez, C., Simon, K., Andrew, M.: Mathematical programming approach for optimally allocating students’ projects to academics in large cohorts. Educ. Chem. Eng. 20, 11–21 (2017)

    Article  Google Scholar 

  5. El-Atta, A.A., Ibrahim, M.M.: Student project allocation with preference lists over (student, project) pairs. In: ICCEE, vol. 1, pp. 375–379 (2009)

    Google Scholar 

  6. Frances, C., Manlove, D.: A 3/2-approximation algorithm for the student-project allocation problem. In: SEA, vol. 103, pp. 8:1–8:13 (2018). https://doi.org/10.4230/LIPIcs.SEA.2018.8

  7. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 9(1), 9–15 (1962)

    Article  MATH  Google Scholar 

  8. Gani, M., AHamid, R., et al.: Optimum allocation of graduation projects: survey and proposed solution. J. Al-Qadisiyah Comput. Sci. Math. 13(1), 58–66 (2021)

    Google Scholar 

  9. Hamada, K., Iwama, K., Miyazaki, S.: The hospitals-residents problem with lower quotas. Algorithmica 74(1), 440–465 (2016)

    Article  MATH  Google Scholar 

  10. Harper, R., Senna, V., Vieira, I., Shahani, A.: A genetic algorithm for the project assignment problem. Comput. Oper. Res. 32(5), 1255–1265 (2005)

    Article  MATH  Google Scholar 

  11. Irving, R., Manlove, D., Sandy, S.: The hospitals/residents problem with ties. In: SWAT, pp. 259–271. Bergen, Norway, July 2000

    Google Scholar 

  12. Ismaili, A., Yahiro, K., Yamaguchi, T., Yokoo, M.: Student-project-resource matching-allocation problems: two-sided matching meets resource allocation. In: AAMAS, pp. 2033–2035 (2019)

    Google Scholar 

  13. Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation bounds for the student-project allocation problem with preferences over projects. J. Discret. Algorithms 13, 59–66 (2012)

    Article  MATH  Google Scholar 

  14. K. Augustine, Irving, R., Manlove, D., S.Colin: profile-based optimal matchings in the student/project allocation problem. In: IWOCA, pp. 213–225 (2014)

    Google Scholar 

  15. Kazakov, D.: Co-ordination of student-project allocation. Manuscript (2002)

    Google Scholar 

  16. Király, Z.: Linear time local approximation algorithm for maximum stable marriage. Algorithms 6(1), 471–484 (2013)

    Article  MATH  Google Scholar 

  17. Kwanashie, K., Manlove, D.: An integer programming approach to the hospitals/residents problem with ties. In: GOR, pp. 263–269 (2013)

    Google Scholar 

  18. Manlove, D., Gregg, O.: Student-project allocation with preferences over projects. J. Discret. Algorithms 6(4), 553–560 (2008)

    Article  MATH  Google Scholar 

  19. Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hardvariants of stable marriage. Theoret. Comput. Sci. 276(1), 261–279 (2002)

    Article  MATH  Google Scholar 

  20. Marco, C., Rolf, F., Stefano, G.: Handling preferences in student-project allocation. Ann. Oper. Res. 275(1), 39–78 (2019)

    Article  MATH  Google Scholar 

  21. Olaosebikan, S., Manlove, D.: An algorithm for strong stability in the student-project allocation problem with ties. In: CALDAM, pp. 384–399 (2020)

    Google Scholar 

  22. Olaosebikan, S., Manlove, D.: Super-stability in the student-project allocation problem with ties. J. Comb. Optim. 43, 1–37 (2020)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Technology, Vinh University, Vinh, Vietnam

    Nguyen Thi Uyen

  2. Cyber School, Vinh University, Vinh, Vietnam

    Tran Xuan Sang

Authors
  1. Nguyen Thi Uyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tran Xuan Sang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nguyen Thi Uyen .

Editor information

Editors and Affiliations

  1. Systems Research Institute of the Polish Academy of Sciences, Warsaw, Poland

    Leszek Rutkowski

  2. Częstochowa University of Technology, Częstochowa, Poland

    Rafał Scherer

  3. Częstochowa University of Technology, Częstochowa, Poland

    Marcin Korytkowski

  4. University of Alberta, Edmonton, AB, Canada

    Witold Pedrycz

  5. AGH University of Science and Technology, Kraków, Poland

    Ryszard Tadeusiewicz

  6. University of Louisville, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Uyen, N.T., Sang, T.X. (2023). An Efficient Algorithm to Find a Maximum Weakly Stable Matching for SPA-ST Problem. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2022. Lecture Notes in Computer Science(), vol 13589. Springer, Cham. https://doi.org/10.1007/978-3-031-23480-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-23480-4_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-23479-8

  • Online ISBN: 978-3-031-23480-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation