{"id":"https://openalex.org/W2051568713","doi":"https://doi.org/10.4018/jamc.2012100101","title":"Round-Table Group Optimization for Sequencing Problems","display_name":"Round-Table Group Optimization for Sequencing Problems","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2051568713","doi":"https://doi.org/10.4018/jamc.2012100101","mag":"2051568713"},"language":"en","primary_location":{"id":"doi:10.4018/jamc.2012100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2012100101","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1808.02185","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Xiao-Feng Xie","orcid":"https://orcid.org/0000-0002-7970-2974"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiao-Feng Xie","raw_affiliation_strings":["The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-7970-2974","affiliations":[{"raw_affiliation_string":"The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.3473,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62674018,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"4","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.2822999954223633,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.2822999954223633,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.218299999833107,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.12800000607967377,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6854000091552734},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5281000137329102},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.43970000743865967},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4388999938964844},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4357999861240387},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4284000098705292},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.41769999265670776}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6854000091552734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6593000292778015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5343000292778015},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.43970000743865967},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4357999861240387},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3059999942779541},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29499998688697815},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.27570000290870667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2745000123977661},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25290000438690186}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4018/jamc.2012100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2012100101","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1808.02185","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.02185","pdf_url":"https://arxiv.org/pdf/1808.02185","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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:igg:jamc00:v:3:y:2012:i:4:p:1-24","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2012100101","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1808.02185","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.02185","pdf_url":"https://arxiv.org/pdf/1808.02185","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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W17748033","https://openalex.org/W97503220","https://openalex.org/W1503085769","https://openalex.org/W1563564537","https://openalex.org/W1836977276","https://openalex.org/W1965735445","https://openalex.org/W1970320473","https://openalex.org/W1971700807","https://openalex.org/W1972346582","https://openalex.org/W1976346448","https://openalex.org/W1984322306","https://openalex.org/W1984701290","https://openalex.org/W1985109028","https://openalex.org/W1989938457","https://openalex.org/W1993433489","https://openalex.org/W2003386571","https://openalex.org/W2004512235","https://openalex.org/W2006751452","https://openalex.org/W2008665401","https://openalex.org/W2009976595","https://openalex.org/W2010681539","https://openalex.org/W2010896455","https://openalex.org/W2012238981","https://openalex.org/W2014615663","https://openalex.org/W2017377855","https://openalex.org/W2018028283","https://openalex.org/W2019065540","https://openalex.org/W2019703523","https://openalex.org/W2032257665","https://openalex.org/W2038443646","https://openalex.org/W2043744383","https://openalex.org/W2043827061","https://openalex.org/W2044166522","https://openalex.org/W2048698391","https://openalex.org/W2049478624","https://openalex.org/W2049967755","https://openalex.org/W2070223281","https://openalex.org/W2073788127","https://openalex.org/W2078211329","https://openalex.org/W2090069860","https://openalex.org/W2098677716","https://openalex.org/W2101097701","https://openalex.org/W2101595632","https://openalex.org/W2116689956","https://openalex.org/W2121656285","https://openalex.org/W2125827607","https://openalex.org/W2128204591","https://openalex.org/W2135113998","https://openalex.org/W2138732110","https://openalex.org/W2140481494","https://openalex.org/W2143740992","https://openalex.org/W2156391157","https://openalex.org/W2156668787","https://openalex.org/W2159505773","https://openalex.org/W2160631673","https://openalex.org/W2161235129","https://openalex.org/W2914775474","https://openalex.org/W3125526941","https://openalex.org/W4242314863"],"related_works":[],"abstract_inverted_index":{"In":[0,25],"this":[1],"paper,":[2],"a":[3,13,26,40,61,80,86,129,141],"round-table":[4,62],"group":[5,23,63],"optimization":[6],"(RTGO)":[7],"algorithm":[8],"is":[9,12,100,138,148,171],"presented.":[10],"RTGO":[11,99,147,164,170],"simple":[14],"meta-heuristic":[15],"framework":[16],"using":[17,79,165,180],"the":[18,29,94,110,115,181],"insights":[19],"of":[20,146],"research":[21],"on":[22,93,151,157],"creativity.":[24],"cooperative":[27],"group,":[28],"agents":[30],"work":[31],"in":[32,39,51,66,140],"iterative":[33],"sessions":[34],"to":[35,91,173],"search":[36,82,88],"innovative":[37],"ideas":[38],"common":[41],"problem":[42,113],"landscape.":[43],"Each":[44],"agent":[45],"has":[46],"one":[47,56],"base":[48,95],"idea":[49,58,70],"stored":[50],"its":[52],"individual":[53],"memory,":[54],"and":[55,72,85,96,114],"social":[57,97],"fed":[59],"by":[60,78,163],"support":[64],"mechanism":[65],"each":[67],"session.":[68],"The":[69,119,144],"combination":[71,136],"improvement":[73],"processes":[74],"are":[75,123],"respectively":[76],"realized":[77,139],"recombination":[81],"(XS)":[83],"strategy":[84],"local":[87],"(LS)":[89],"strategy,":[90],"build":[92],"ideas.":[98],"then":[101,149],"implemented":[102],"for":[103],"solving":[104],"two":[105],"difficult":[106],"sequencing":[107],"problems,":[108],"i.e.,":[109],"flowshop":[111],"scheduling":[112],"quadratic":[116],"assignment":[117],"problem.":[118],"domain-specific":[120],"LS":[121,183],"strategies":[122],"adopted":[124],"from":[125],"existing":[126,176],"algorithms,":[127],"whereas":[128],"general":[130],"XS":[131],"class,":[132],"called":[133],"socially":[134],"biased":[135],"(SBX),":[137],"modular":[142],"form.":[143],"performance":[145,156],"evaluated":[150],"commonly-used":[152],"benchmark":[153],"datasets.":[154],"Good":[155],"different":[158],"problems":[159],"can":[160],"be":[161],"achieved":[162],"appropriate":[166],"SBX":[167],"operators.":[168],"Furthermore,":[169],"able":[172],"outperform":[174],"some":[175],"methods,":[177],"including":[178],"methods":[179],"same":[182],"strategies.":[184]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}