{"id":"https://openalex.org/W3154800592","doi":"https://doi.org/10.1145/3437260","title":"Multi-user Remote Lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm","display_name":"Multi-user Remote Lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm","publication_year":2021,"publication_date":"2021-04-08","ids":{"openalex":"https://openalex.org/W3154800592","doi":"https://doi.org/10.1145/3437260","mag":"3154800592"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3437260","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3437260","source":{"id":"https://openalex.org/S4210185969","display_name":"ACM/IMS Transactions on Data Science","issn_l":"2577-3224","issn":["2577-3224","2691-1922"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3437260","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044200395","display_name":"Seid Miad Zandavi","orcid":"https://orcid.org/0000-0003-3015-5962"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Seid Miad Zandavi","raw_affiliation_strings":["School of Computer Science, The University of Sydney, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045843249","display_name":"Yuk Ying Chung","orcid":"https://orcid.org/0000-0002-3158-9650"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Vera Chung","raw_affiliation_strings":["School of Computer Science, The University of Sydney, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005831779","display_name":"Ali Anaissi","orcid":"https://orcid.org/0000-0002-8864-0314"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ali Anaissi","raw_affiliation_strings":["School of Computer Science, The University of Sydney, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.349,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":3,"citation_normalized_percentile":{"value":0.556257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":72,"max":76},"biblio":{"volume":"2","issue":"2","first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11283","display_name":"Experimental Learning in Engineering","score":0.9969,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11283","display_name":"Experimental Learning in Engineering","score":0.9969,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9738,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9657,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.56805104}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7761801},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7194189},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6575663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.64112836},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6261478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.59818244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5697956},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.56805104},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4909797},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.45748654},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.43065774},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4243915},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3473968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18946835},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3437260","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3437260","source":{"id":"https://openalex.org/S4210185969","display_name":"ACM/IMS Transactions on Data Science","issn_l":"2577-3224","issn":["2577-3224","2691-1922"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.11708","pdf_url":"http://arxiv.org/pdf/2003.11708","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3437260","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3437260","source":{"id":"https://openalex.org/S4210185969","display_name":"ACM/IMS Transactions on Data Science","issn_l":"2577-3224","issn":["2577-3224","2691-1922"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":30,"referenced_works":["https://openalex.org/W1549119093","https://openalex.org/W1910477057","https://openalex.org/W1968231253","https://openalex.org/W1994996222","https://openalex.org/W2010686093","https://openalex.org/W2011483065","https://openalex.org/W2013318791","https://openalex.org/W2025691702","https://openalex.org/W2042802301","https://openalex.org/W2053137349","https://openalex.org/W2055579305","https://openalex.org/W2057379233","https://openalex.org/W2092399973","https://openalex.org/W2095074627","https://openalex.org/W2098810165","https://openalex.org/W2116661285","https://openalex.org/W2144149212","https://openalex.org/W2159913792","https://openalex.org/W2265080090","https://openalex.org/W2381346163","https://openalex.org/W2508676848","https://openalex.org/W2575503903","https://openalex.org/W2598652614","https://openalex.org/W2746621483","https://openalex.org/W2800058671","https://openalex.org/W2820673085","https://openalex.org/W2975582018","https://openalex.org/W3021379131","https://openalex.org/W3159068915","https://openalex.org/W4254300870"],"related_works":["https://openalex.org/W797244100","https://openalex.org/W3033694952","https://openalex.org/W2911215968","https://openalex.org/W2809748609","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W2185826091","https://openalex.org/W2048470382"],"abstract_inverted_index":{"The":[0,17,55,105],"scheduling":[1],"of":[2,22,64,75],"multi-user":[3],"remote":[4,49],"laboratories":[5,50],"is":[6,40,79,90],"modeled":[7],"as":[8],"a":[9,111],"multimodal":[10,85],"function":[11],"for":[12,47,68],"the":[13,23,44,48,59],"proposed":[14,41,56],"optimization":[15,19],"algorithm.":[16],"hybrid":[18,93],"algorithm,":[20,26],"hybridization":[21],"Nelder-Mead":[24],"Simplex":[25,34,60,94,98],"and":[27,66,87,101],"Non-dominated":[28,35],"Sorting":[29,36],"Genetic":[30,37,99],"Algorithm":[31,38],"(NSGA),":[32],"named":[33],"(SNSGA),":[39],"to":[42,51,81,114],"optimize":[43],"timetable":[45,116],"problem":[46],"coordinate":[52],"shared":[53],"access.":[54],"algorithm":[57,61],"utilizes":[58],"in":[62],"terms":[63],"exploration":[65],"NSGA":[67],"sorting":[69],"local":[70],"optimum":[71],"points":[72],"with":[73,92],"consideration":[74],"potential":[76],"areas.":[77],"SNSGA":[78,109],"applied":[80],"difficult":[82],"nonlinear":[83],"continuous":[84],"functions,":[86],"its":[88],"performance":[89,113],"compared":[91],"Particle":[95],"Swarm":[96],"Optimization,":[97],"Algorithm,":[100],"other":[102],"heuristic":[103],"algorithms.":[104],"results":[106],"show":[107],"that":[108],"has":[110],"competitive":[112],"address":[115],"problems.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3154800592","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-01-16T04:54:41.766619","created_date":"2021-04-26"}