IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v42y2025i05ns0217595925500058.html
   My bibliography  Save this article

A New Heuristic Algorithm for Student-Project Allocation with Lecturer Preferences and Ties

Author

Listed:
  • Uyen T. Nguyen

    (Institute of Engineering and Technology, Vinh University, 182 Le Duan Street, Vinh City, Nghe An, Vietnam)

  • Sang X. Tran

    (Cyber School, Vinh University, 182 Le Duan Street, Vinh City, Nghe An, Vietnam)

  • Canh V. Pham

    (ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam)

Abstract

The problem of The Student-Project Allocation problem with lecturer preferences over the Students containing Ties (SPA-ST) has attracted the attention of researchers 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 the 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 are 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 algorithm designs two heuristic functions to improve the solution quality and execution time. Experimental results on large randomly generated instances show that our algorithm is more efficient than the existing methods in terms of execution time and solution quality.

Suggested Citation

  • Uyen T. Nguyen & Sang X. Tran & Canh V. Pham, 2025. "A New Heuristic Algorithm for Student-Project Allocation with Lecturer Preferences and Ties," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 42(05), pages 1-27, October.
    • Handle: RePEc:wsi:apjorx:v:42:y:2025:i:05:n:s0217595925500058
    DOI: 10.1142/S0217595925500058
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595925500058
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595925500058?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:42:y:2025:i:05:n:s0217595925500058. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.