{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:12:31Z","timestamp":1760235151711,"version":"build-2065373602"},"reference-count":46,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students\u2019 learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames.<\/jats:p>","DOI":"10.3390\/a14080219","type":"journal-article","created":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T11:53:23Z","timestamp":1626868403000},"page":"219","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8011-933X","authenticated-orcid":false,"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[{"name":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"}]},{"given":"Kerri","family":"Morgan","sequence":"additional","affiliation":[{"name":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"}]},{"given":"Susan","family":"Bedingfield","sequence":"additional","affiliation":[{"name":"Clayton School of Information Technology, Monash University, Clayton, VIC 3800, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4955-9684","authenticated-orcid":false,"given":"Asef","family":"Nazari","sequence":"additional","affiliation":[{"name":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,21]]},"reference":[{"key":"ref_1","unstructured":"Patrick, C., Peach, D., and Pocknee, C. (2021, July 21). The WIL (Work Integrated Learning) Report: A National Scoping Study (Australian Learning and Teaching Council (ALTC) Final Report). Available online: www.altc.edu.auandwww.acen.edu.au."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Sun, Z. (2019, January 10\u201316). Matchings with Constraints. Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19), Macao, China.","DOI":"10.24963\/ijcai.2019\/921"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.outlook.2019.07.005","article-title":"Nurse practitioner student clinical placement processes: A national survey of nurse practitioner programs","volume":"68","author":"Doherty","year":"2019","journal-title":"Nurs. Outlook"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.2147\/AMEP.S108074","article-title":"National Medical School Matching Program: Optimizing outcomes","volume":"7","author":"Eltorai","year":"2016","journal-title":"Adv. Med Educ. Pract."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., and Wolsey, L.A. (1988). Integer and Combinatorial Optimization, Wiley-Interscience.","DOI":"10.1002\/9781118627372"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Manlove, D. (2013). Algorithmics of Matching under Preferences, World Scientific.","DOI":"10.1142\/8591"},{"key":"ref_7","unstructured":"Papadimitriou, C.H., and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity, Courier Corporation."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and Stutzle, T. (2004). Ant Colony Optimization, MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On Representatives of Subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. Lond. Math. Soc."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College Admissions and the Stability of Marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TEM.1965.6446468","article-title":"Optimal Assignment of Research and Development Projects in a Large Company Using an Integer Programming Model","volume":"EM-12","author":"Dov","year":"1965","journal-title":"IEEE Trans. Eng. Manag."},{"key":"ref_13","unstructured":"Gusfield, D., and Irving, R. (1989). The Stable Marriage Problem: Structure and Algorithms, MIT Press."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","article-title":"An efficient algorithm for the stable roommates problem","volume":"6","author":"Irving","year":"1985","journal-title":"J. Algorithms"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","article-title":"Hard variants of stable marriage","volume":"276","author":"Manlove","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","article-title":"Stable marriage and indifference","volume":"48","author":"Irving","year":"1994","journal-title":"Discret. Appl. Math"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/jagm.2002.1219","article-title":"The Stable Roommates Problem with Ties","volume":"43","author":"Irving","year":"2002","journal-title":"J. Algorithms"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Klaus, B., Manlove, D.F., and Rossi, F. (2016). Matching Under Preferences, Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.015"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/inte.1060.0263","article-title":"A Novel Problem for a Vintage Technique: Using Mixed-Integer Programming to Match Wineries and Distributors","volume":"37","author":"Cholette","year":"2007","journal-title":"Interfaces"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10479-007-0210-4","article-title":"Mixed-integer Programming Models for an Employee Scheduling Problem with Multiple Shifts and Work Locations","volume":"155","author":"Sherali","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"ref_21","first-page":"607","article-title":"Online Resource Matching for Heterogeneous Grid Environments","volume":"2","author":"Naik","year":"2005","journal-title":"IEEE Int. Symp. Clust. Comput. Grid"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1287\/inte.2017.0940","article-title":"Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization","volume":"48","author":"Magnanti","year":"2018","journal-title":"INFORMS J. Appl. Anal."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/j.cor.2003.11.003","article-title":"A Genetic Algorithm for the Project Assignment Problem","volume":"32","author":"Harper","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.dss.2004.06.004","article-title":"Matching Information Security Vulnerabilities to Organizational Security Profiles: A Genetic Algorithm Approach","volume":"41","author":"Gupta","year":"2006","journal-title":"Decis. Support Syst."},{"key":"ref_25","first-page":"127","article-title":"Ant Colony Optimization for Multilevel Assembly Job Shop Scheduling","volume":"6","author":"Omkumar","year":"2008","journal-title":"Int. J. Appl. Manag. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.ejor.2011.09.035","article-title":"An Ant Colony Optimisation Algorithm for Solving the Asymmetric Traffic Assignment Problem","volume":"217","author":"Gallo","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJAPUC.2016010101","article-title":"Image Edge Detection Based on Ant Colony Optimization Algorithm","volume":"8","author":"Huan","year":"2016","journal-title":"Int. J. Adv. Pervasive Ubiquitous Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Elmi, A., Nazari, A., and Schneider, J.G. (2020). Minimising Cycle Time in Assembly Lines: A Novel Ant Colony Optimisation Approach. Australasian Joint Conference on Artificial Intelligence, Springer.","DOI":"10.1007\/978-3-030-64984-5_10"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Nazari, A., and Elmi, A. (2020, January 19\u201324). An Ant Colony Optimisation Based Heuristic for Mixed-model Assembly Line Balancing with Setups. Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185757"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.jocs.2015.01.001","article-title":"An Ant Colony Optimization Heuristic for Constrained Task Allocation Problem","volume":"7","author":"Pendharkar","year":"2015","journal-title":"J. Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2004.11.026","article-title":"Ant Colony Optimization for the Cell Assignment Problem in PCS Networks","volume":"33","author":"Shyu","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_32","first-page":"167","article-title":"An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)","volume":"200","author":"Chaharsooghi","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Nazari, A., and Aleti, A. (2020). Multi-objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem. Algorithms, 13.","DOI":"10.3390\/a13100252"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX\u2013MIN ant system","volume":"16","author":"Hoos","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_36","unstructured":"Gurobi Optimization (2021, July 21). Gurobi Optimizer Reference Manual. Available online: https:\/\/www.gurobi.com\/."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","article-title":"The Lagrangian Relaxation Method for Solving Integer Programming Problems","volume":"50","author":"Fisher","year":"2004","journal-title":"Manag. Sci."},{"key":"ref_38","unstructured":"Wolsey, L.A. (1998). Integer Programming, Wiley-Interscience."},{"key":"ref_39","first-page":"130","article-title":"Hybrids of Integer Programming and ACO for Resource Constrained Job Scheduling","volume":"Volume 8457","author":"Blesa","year":"2014","journal-title":"Hybrid Metaheuristics"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s10732-014-9260-3","article-title":"A Lagrangian Relaxation and ACO Hybrid for Resource Constrained Project Scheduling with Discounted Cash Flows","volume":"20","author":"Thiruvady","year":"2014","journal-title":"J. Heuristics"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s13675-014-0023-6","article-title":"A Lagrangian-ACO Matheuristic for Car Sequencing","volume":"2","author":"Thiruvady","year":"2014","journal-title":"EURO J. Comput. Optim."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Blum, C., and Ernst, A.T. (2020). Solution Merging in Matheuristics for Resource Constrained Job Scheduling. Algorithms, 13.","DOI":"10.3390\/a13100256"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Wallace, M. (2004). Propagation Guided Large Neighborhood Search. Principles and Practice of Constraint Programming\u2014CP 2004, Springer.","DOI":"10.1007\/b100482"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1080\/00207543.2019.1630765","article-title":"Large Neighbourhood Search based on Mixed Integer Programming and Ant Colony Optimisation for Car Sequencing","volume":"58","author":"Thiruvady","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Brent, O., Thiruvady, D., G\u00f3mez-Iglesias, A., and Garcia-Flores, R. (2014, January 6\u201311). A Parallel Lagrangian-ACO Heuristic for Project Scheduling. Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China.","DOI":"10.1109\/CEC.2014.6900504"},{"key":"ref_46","unstructured":"Wagner, M., Li, X., and Hendtlass, T. (February, January 31). Resource Constrained Job Scheduling with Parallel Constraint-Based ACO. Proceedings of the Artificial Life and Computational Intelligence: Third Australasian Conference, ACALCI 2017, Geelong, VIC, Australia."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/219\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:32:52Z","timestamp":1760164372000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":46,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["a14080219"],"URL":"https:\/\/doi.org\/10.3390\/a14080219","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,7,21]]}}}