{"id":"https://openalex.org/W3014560328","doi":"https://doi.org/10.1145/3377930.3389818","title":"ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint","display_name":"ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint","publication_year":2020,"publication_date":"2020-06-25","ids":{"openalex":"https://openalex.org/W3014560328","doi":"https://doi.org/10.1145/3377930.3389818","mag":"3014560328"},"language":"en","primary_location":{"id":"doi:10.1145/3377930.3389818","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3389818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-02531062","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080653787","display_name":"Lucas Groleaz","orcid":null},"institutions":[{"id":"https://openalex.org/I48430043","display_name":"Institut National des Sciences Appliqu\u00e9es de Lyon","ror":"https://ror.org/050jn9y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I203339264","https://openalex.org/I48430043"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lucas Groleaz","raw_affiliation_strings":["Infologic, INSA Lyon, Villeurbanne","M2DisCo - Geometry Processing and Constrained Optimization (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Infologic, INSA Lyon, Villeurbanne","institution_ids":["https://openalex.org/I48430043"]},{"raw_affiliation_string":"M2DisCo - Geometry Processing and Constrained Optimization (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074032418","display_name":"Samba Ndiaye","orcid":"https://orcid.org/0009-0003-7568-4494"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I178906410","display_name":"Lyon College","ror":"https://ror.org/03c4kec23","country_code":"US","type":"education","lineage":["https://openalex.org/I178906410"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Samba N. Ndiaye","raw_affiliation_strings":["Univ. Lyon, Villeurbanne","M2DisCo - Geometry Processing and Constrained Optimization (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Lyon, Villeurbanne","institution_ids":["https://openalex.org/I178906410","https://openalex.org/I100532134"]},{"raw_affiliation_string":"M2DisCo - Geometry Processing and Constrained Optimization (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109237080","display_name":"Christine Solnon","orcid":"https://orcid.org/0000-0002-0919-496X"},"institutions":[{"id":"https://openalex.org/I48430043","display_name":"Institut National des Sciences Appliqu\u00e9es de Lyon","ror":"https://ror.org/050jn9y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I203339264","https://openalex.org/I48430043"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christine Solnon","raw_affiliation_strings":["INSA Lyon, Villeurbanne"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INSA Lyon, Villeurbanne","institution_ids":["https://openalex.org/I48430043"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9295,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77559583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9995999932289124,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9995999932289124,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9952999949455261,"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/tardiness","display_name":"Tardiness","score":0.8387322425842285},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6657308340072632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6238588094711304},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.56902676820755},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.54825758934021},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5328370332717896},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5177011489868164},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4725334942340851},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4690903425216675},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46857333183288574},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4383108615875244},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41114044189453125},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25790268182754517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18974268436431885},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.088957279920578}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8387322425842285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6657308340072632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6238588094711304},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.56902676820755},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.54825758934021},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5328370332717896},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5177011489868164},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4725334942340851},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4690903425216675},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46857333183288574},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4383108615875244},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41114044189453125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25790268182754517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18974268436431885},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.088957279920578},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3377930.3389818","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377930.3389818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02531062v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02531062","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"GECCO 2020 - Genetic and Evolutionary Computation Conference, Jul 2020, Cancun, Mexico. pp.13--21, ⟨10.1145/3377930.3389818⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02531062v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02531062","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"GECCO 2020 - Genetic and Evolutionary Computation Conference, Jul 2020, Cancun, Mexico. pp.13--21, ⟨10.1145/3377930.3389818⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4399999976158142,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1547709303","https://openalex.org/W1593786356","https://openalex.org/W1790057117","https://openalex.org/W1791215375","https://openalex.org/W1933569933","https://openalex.org/W1975009952","https://openalex.org/W1989985823","https://openalex.org/W1996182128","https://openalex.org/W2027140251","https://openalex.org/W2034801210","https://openalex.org/W2038345112","https://openalex.org/W2058371496","https://openalex.org/W2062443438","https://openalex.org/W2084967063","https://openalex.org/W2090275183","https://openalex.org/W2121852392","https://openalex.org/W2133002845","https://openalex.org/W2138403270","https://openalex.org/W2147148915","https://openalex.org/W2154487696","https://openalex.org/W2233279483","https://openalex.org/W2259386961","https://openalex.org/W2577408049","https://openalex.org/W2613485998","https://openalex.org/W2642675087","https://openalex.org/W2790098940","https://openalex.org/W2950680102","https://openalex.org/W4255730472"],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2080981203","https://openalex.org/W2089884908","https://openalex.org/W3097192092","https://openalex.org/W2937685542","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2321371676"],"abstract_inverted_index":{"We":[0,84,114,167],"consider":[1],"a":[2,29,41,62,66,137,150,173,182],"RCPSP":[3],"(resource":[4],"constrained":[5],"project":[6],"scheduling":[7],"problem),":[8],"the":[9,44,54,87,116,121,158],"goal":[10],"of":[11,43,56,72,89,118,139],"which":[12,39],"is":[13,40,68],"to":[14,21,101,132,156,165],"schedule":[15],"jobs":[16,48,74],"on":[17,120,181],"machines":[18],"in":[19,154],"order":[20,155],"minimise":[22],"job":[23],"tardiness.":[24],"This":[25],"problem":[26],"comes":[27],"from":[28,129,186],"real":[30],"industrial":[31,188],"application,":[32],"and":[33,53,105,124,145,147,177],"it":[34,127],"requires":[35],"an":[36,96,130,178],"additional":[37],"constraint":[38],"generalisation":[42],"classical":[45],"cumulative":[46],"constraint:":[47],"are":[49,80],"partitioned":[50],"into":[51],"groups,":[52],"number":[55],"active":[57,69],"groups":[58],"must":[59],"never":[60],"exceeds":[61],"given":[63],"capacity":[64],"(where":[65],"group":[67],"when":[70],"some":[71,78],"its":[73],"have":[75],"started":[76],"while":[77],"others":[79],"not":[81],"yet":[82],"completed).":[83],"first":[85],"study":[86,115],"complexity":[88],"this":[90],"new":[91,163],"constraint.":[92],"Then,":[93],"we":[94,106,135,148],"describe":[95],"Ant":[97],"Colony":[98],"Optimisation":[99],"algorithm":[100,152],"solve":[102],"our":[103,170,187],"problem,":[104],"compare":[107,169],"three":[108],"different":[109],"pheromone":[110],"structures":[111],"for":[112,161],"it.":[113],"influence":[117],"parameters":[119],"solving":[122],"process,":[123],"show":[125],"that":[126],"varies":[128],"instance":[131,164],"another.":[133],"Hence,":[134],"identify":[136],"subset":[138],"parameter":[140],"settings":[141],"with":[142,172],"complementary":[143],"strengths":[144],"weaknesses,":[146],"use":[149],"per-instance":[151],"selector":[153],"select":[157],"best":[159],"setting":[160],"each":[162],"solve.":[166],"experimentally":[168],"approach":[171,176,180],"tabu":[174],"search":[175],"exact":[179],"data":[183],"set":[184],"coming":[185],"application.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}