{"id":"https://openalex.org/W3186454112","doi":"https://doi.org/10.3390/a14080219","title":"Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation","display_name":"Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3186454112","doi":"https://doi.org/10.3390/a14080219","mag":"3186454112"},"language":"en","primary_location":{"id":"doi:10.3390/a14080219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080219","pdf_url":"https://www.mdpi.com/1999-4893/14/8/219/pdf?version=1626947243","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/8/219/pdf?version=1626947243","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046309576","display_name":"Dhananjay Thiruvady","orcid":"https://orcid.org/0000-0002-8011-933X"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Dhananjay Thiruvady","raw_affiliation_strings":["School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia","institution_ids":["https://openalex.org/I149704539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025441020","display_name":"Kerri Morgan","orcid":"https://orcid.org/0000-0002-7263-8340"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kerri Morgan","raw_affiliation_strings":["School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia","institution_ids":["https://openalex.org/I149704539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091418049","display_name":"Susan Bedingfield","orcid":"https://orcid.org/0000-0002-5861-0149"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Susan Bedingfield","raw_affiliation_strings":["Clayton School of Information Technology, Monash University, Clayton, VIC 3800, Australia"],"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology, Monash University, Clayton, VIC 3800, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004653709","display_name":"Asef Nazari","orcid":"https://orcid.org/0000-0003-4955-9684"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Asef Nazari","raw_affiliation_strings":["School of Information Technology, Deakin University, Geelong, VIC 3217, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Geelong, VIC 3217, Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5046309576"],"corresponding_institution_ids":["https://openalex.org/I149704539"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.0738,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78615053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"8","first_page":"219","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.8207653760910034},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6509345769882202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6467254161834717},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5688806176185608},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4891970157623291},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4605315029621124},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4139717221260071},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.40962204337120056},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35110288858413696},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17575278878211975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12538787722587585},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10364216566085815},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10100623965263367}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.8207653760910034},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6509345769882202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6467254161834717},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5688806176185608},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4891970157623291},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4605315029621124},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4139717221260071},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.40962204337120056},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35110288858413696},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17575278878211975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12538787722587585},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10364216566085815},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10100623965263367}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3390/a14080219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080219","pdf_url":"https://www.mdpi.com/1999-4893/14/8/219/pdf?version=1626947243","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:publications/87c424f4-1374-41fc-afa0-261e6db3a51e","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/87c424f4-1374-41fc-afa0-261e6db3a51e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thiruvady , D , Morgan , K , Bedingfield , S & Nazari , A 2021 , ' Allocating students to industry placements using integer programming and ant colony optimisation ' , Algorithms , vol. 14 , no. 8 , 219 . https://doi.org/10.3390/a14080219","raw_type":"article"},{"id":"pmh:oai:doaj.org/article:bafd4c267a7641f391933b770cfb5b3b","is_oa":true,"landing_page_url":"https://doaj.org/article/bafd4c267a7641f391933b770cfb5b3b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 8, p 219 (2021)","raw_type":"article"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30153747","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/20654601","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Allocating_students_to_industry_placements_using_integer_programming_and_ant_colony_optimisation/20654601","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/8/219/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14080219","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 8; Pages: 219","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14080219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080219","pdf_url":"https://www.mdpi.com/1999-4893/14/8/219/pdf?version=1626947243","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3186454112.pdf","grobid_xml":"https://content.openalex.org/works/W3186454112.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W633535488","https://openalex.org/W975772119","https://openalex.org/W1508891358","https://openalex.org/W1537405558","https://openalex.org/W1573676079","https://openalex.org/W1594085999","https://openalex.org/W1801849579","https://openalex.org/W1964152083","https://openalex.org/W1974479993","https://openalex.org/W1976685092","https://openalex.org/W1994483530","https://openalex.org/W1999739253","https://openalex.org/W1999921253","https://openalex.org/W2003967435","https://openalex.org/W2004617458","https://openalex.org/W2011119767","https://openalex.org/W2011268914","https://openalex.org/W2017087739","https://openalex.org/W2028284140","https://openalex.org/W2039568841","https://openalex.org/W2053913299","https://openalex.org/W2056052994","https://openalex.org/W2057458709","https://openalex.org/W2059209074","https://openalex.org/W2063292248","https://openalex.org/W2068115726","https://openalex.org/W2068574579","https://openalex.org/W2085116982","https://openalex.org/W2091887239","https://openalex.org/W2126756319","https://openalex.org/W2154929945","https://openalex.org/W2169337137","https://openalex.org/W2231411611","https://openalex.org/W2465033658","https://openalex.org/W2505968561","https://openalex.org/W2552148552","https://openalex.org/W2564271336","https://openalex.org/W2804165948","https://openalex.org/W2954019430","https://openalex.org/W2964854647","https://openalex.org/W2972004949","https://openalex.org/W3083711483","https://openalex.org/W3091381131","https://openalex.org/W3092440396","https://openalex.org/W3108787497","https://openalex.org/W4213094076","https://openalex.org/W4236384091","https://openalex.org/W4299796063","https://openalex.org/W6631894337","https://openalex.org/W6644310321","https://openalex.org/W6671518994"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W1925942709","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2047683846","https://openalex.org/W2381829748","https://openalex.org/W2044902158","https://openalex.org/W2244460820","https://openalex.org/W2082154838"],"abstract_inverted_index":{"The":[0,82,124,153,196],"increasing":[1,221],"demand":[2],"for":[3,10,105,118,206,225],"work-ready":[4],"students":[5,48,78,106,186],"has":[6,173],"heightened":[7],"the":[8,71,75,96,116,135,145,148,157,162,177,191,194,203,216,222],"need":[9],"universities":[11],"to":[12,18,79,120,176,189,241],"provide":[13],"work":[14],"integrated":[15],"learning":[16,23],"programs":[17],"enhance":[19],"and":[20,34,38,62,89,115,143,187],"reinforce":[21],"students\u2019":[22],"experiences.":[24],"Students":[25],"benefit":[26],"most":[27],"when":[28,44],"placements":[29,188],"meet":[30,50],"their":[31,51],"academic":[32],"requirements":[33],"graduate":[35],"aspirations.":[36],"Businesses":[37],"community":[39],"partners":[40,119],"are":[41,46,68],"more":[42],"engaged":[43],"they":[45],"allocated":[47],"that":[49,156,199],"industry":[52,80,90,103],"requirements.":[53],"In":[54],"this":[55],"paper,":[56],"both":[57],"an":[58,63,167,226],"integer":[59,136,200],"programming":[60,137,201],"model":[61,138,150,159],"ant":[64,229],"colony":[65,230],"optimisation":[66,231],"heuristic":[67],"proposed,":[69],"with":[70],"aim":[72],"of":[73,77,95,147,185,193,210],"automating":[74],"allocation":[76],"placements.":[81],"emphasis":[83],"is":[84,127,151,170,202,238],"on":[85],"maximising":[86],"student":[87,122],"engagement":[88],"partner":[91],"satisfaction.":[92],"As":[93],"part":[94],"objectives,":[97],"these":[98],"methods":[99],"incorporate":[100],"diversity":[101],"in":[102,128],"sectors":[104],"undertaking":[107],"multiple":[108],"placements,":[109],"gender":[110],"equity":[111],"across":[112],"placement":[113],"providers,":[114],"provision":[117],"rank":[121],"selections.":[123],"experimental":[125],"analysis":[126],"two":[129],"parts:":[130],"(a)":[131],"we":[132],"investigate":[133],"how":[134],"performs":[139],"against":[140],"manual":[141,164],"allocations":[142],"(b)":[144],"scalability":[146,192],"IP":[149,158,227],"examined.":[152],"results":[154,197],"show":[155,198],"easily":[160],"outperforms":[161],"previous":[163],"allocations.":[165],"Additionally,":[166],"artificial":[168],"dataset":[169],"generated":[171],"which":[172],"similar":[174],"properties":[175],"original":[178],"data":[179],"but":[180],"also":[181],"includes":[182],"greater":[183],"numbers":[184],"test":[190],"algorithms.":[195],"best":[204],"option":[205],"problem":[207,217],"instances":[208],"consisting":[209],"less":[211],"than":[212],"3000":[213],"students.":[214],"When":[215],"becomes":[218],"larger,":[219],"significantly":[220],"time":[223],"required":[224],"solution,":[228],"provides":[232],"a":[233],"useful":[234],"alternative":[235],"as":[236],"it":[237],"always":[239],"able":[240],"find":[242],"good":[243],"feasible":[244],"solutions":[245],"within":[246],"short":[247],"time-frames.":[248]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}