{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:52:02Z","timestamp":1781106722218,"version":"3.54.1"},"reference-count":66,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>In this paper, a round-table group optimization (RTGO) algorithm is presented. RTGO is a simple meta-heuristic framework using the insights of research on group creativity. In a cooperative group, the agents work in iterative sessions to search innovative ideas in a common problem landscape. Each agent has one base idea stored in its individual memory, and one social idea fed by a round-table group support mechanism in each session. The idea combination and improvement processes are respectively realized by using a recombination search (XS) strategy and a local search (LS) strategy, to build on the base and social ideas. RTGO is then implemented for solving two difficult sequencing problems, i.e., the flowshop scheduling problem and the quadratic assignment problem. The domain-specific LS strategies are adopted from existing algorithms, whereas a general XS class, called socially biased combination (SBX), is realized in a modular form. The performance of RTGO is then evaluated on commonly-used benchmark datasets. Good performance on different problems can be achieved by RTGO using appropriate SBX operators. Furthermore, RTGO is able to outperform some existing methods, including methods using the same LS strategies.<\/p>","DOI":"10.4018\/jamc.2012100101","type":"journal-article","created":{"date-parts":[[2013,1,29]],"date-time":"2013-01-29T16:25:28Z","timestamp":1359476728000},"page":"1-24","source":"Crossref","is-referenced-by-count":2,"title":["Round-Table Group Optimization for Sequencing Problems"],"prefix":"10.4018","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7970-2974","authenticated-orcid":true,"given":"Xiao-Feng","family":"Xie","sequence":"first","affiliation":[{"name":"The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2012100101-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.06.039"},{"key":"jamc.2012100101-1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00067-2"},{"issue":"11","key":"jamc.2012100101-2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing test problems by electronic mail.","volume":"41","author":"J.Beasley","year":"1990","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2012100101-3","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-9004.2009.00252.x"},{"key":"jamc.2012100101-4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"jamc.2012100101-5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00352-5"},{"key":"jamc.2012100101-6","unstructured":"Cicirello, V. A., & Smith, S. F. (2000). Modeling GA performance for control parameter optimization. In Proceedings of the Genetic and Evolutionary Computation Conference, Las Vegas, NV (pp. 235-242)."},{"key":"jamc.2012100101-7","doi-asserted-by":"publisher","DOI":"10.1207\/s15326934crj1803_13"},{"key":"jamc.2012100101-8","doi-asserted-by":"publisher","DOI":"10.1126\/science.1098254"},{"key":"jamc.2012100101-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.05.073"},{"key":"jamc.2012100101-10","unstructured":"Deroussi, L., Gourgand, M., Kemmoe, S., & Quilliot, A. (2005). Discrete particle swarm optimization for the permutation flow shop problem. In Proceedings of the IMACS World Congress on Scientific Computation, Applied Mathematics and Simulation (pp. T2-I-91\u20130824)."},{"key":"jamc.2012100101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.004"},{"key":"jamc.2012100101-12","doi-asserted-by":"publisher","DOI":"10.1006\/anbe.1995.0164"},{"issue":"2","key":"jamc.2012100101-13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","article-title":"Ant colonies for the quadratic assignment problem.","volume":"50","author":"L.Gambardella","year":"1999","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"jamc.2012100101-14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0140525X97000010","article-title":"What memory is for.","volume":"20","author":"A. M.Glenberg","year":"1997","journal-title":"The Behavioral and Brain Sciences"},{"key":"jamc.2012100101-15","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"jamc.2012100101-16","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602106"},{"key":"jamc.2012100101-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00016-9"},{"key":"jamc.2012100101-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.061"},{"key":"jamc.2012100101-19","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2011010103"},{"key":"jamc.2012100101-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jesp.2011.01.004"},{"key":"jamc.2012100101-21","doi-asserted-by":"crossref","unstructured":"Koivisto, M., & Parviainen, P. (2010). A space-time tradeoff for permutation problems. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX (pp. 484-492).","DOI":"10.1137\/1.9781611973075.41"},{"key":"jamc.2012100101-22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883272"},{"key":"jamc.2012100101-23","doi-asserted-by":"publisher","DOI":"10.1145\/1164394.1164395"},{"key":"jamc.2012100101-24","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1100.1168"},{"key":"jamc.2012100101-25","doi-asserted-by":"publisher","DOI":"10.1109\/69.806935"},{"key":"jamc.2012100101-26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"issue":"4","key":"jamc.2012100101-27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.15388\/Informatica.2003.037","article-title":"A modified simulated annealing algorithm for the quadratic assignment problem.","volume":"14","author":"A.Misevicius","year":"2003","journal-title":"Informatica"},{"key":"jamc.2012100101-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2004.03.001"},{"issue":"2","key":"jamc.2012100101-29","first-page":"368","article-title":"Incremental social learning in particle swarms. IEEE Transactions on Systems, Man, and Cybernetics","volume":"41","author":"M. A.Montes de Oca","year":"2011","journal-title":"Part B"},{"key":"jamc.2012100101-30","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(96)00053-8"},{"key":"jamc.2012100101-31","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"jamc.2012100101-32","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(03)00184-1"},{"key":"jamc.2012100101-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2004.02.008"},{"key":"jamc.2012100101-34","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.93.1.23"},{"key":"jamc.2012100101-35","author":"A.Newell","year":"1972","journal-title":"Human problem solving"},{"key":"jamc.2012100101-36","doi-asserted-by":"publisher","DOI":"10.1207\/s15327957pspr1003_1"},{"key":"jamc.2012100101-37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00037-2"},{"key":"jamc.2012100101-38","author":"A. F.Osborn","year":"1953","journal-title":"Applied imagination: Principles and procedures of creative problem solving"},{"key":"jamc.2012100101-39","doi-asserted-by":"publisher","DOI":"10.1111\/1464-0597.00013"},{"key":"jamc.2012100101-40","doi-asserted-by":"publisher","DOI":"10.1002\/j.2162-6057.2009.tb01304.x"},{"key":"jamc.2012100101-41","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00908-6"},{"key":"jamc.2012100101-42","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2007.01.004"},{"issue":"2","key":"jamc.2012100101-43","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1057\/jors.1985.30","article-title":"An improved heuristic for the quadratic assignment problem.","volume":"36","author":"C.Reeves","year":"1985","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2012100101-44","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0014-K"},{"key":"jamc.2012100101-45","doi-asserted-by":"publisher","DOI":"10.1348\/000712609X414204"},{"key":"jamc.2012100101-46","author":"E. M.Rogers","year":"2003","journal-title":"Diffusion of innovations"},{"key":"jamc.2012100101-47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.017"},{"key":"jamc.2012100101-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.12.006"},{"key":"jamc.2012100101-49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"jamc.2012100101-50","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.5.612.12052"},{"key":"jamc.2012100101-51","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.095"},{"issue":"4","key":"jamc.2012100101-52","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/07421222.1999.11518225","article-title":"The creative process: The effects of group memory on individual idea generation.","volume":"15","author":"J. W.Satzinger","year":"1999","journal-title":"Journal of Management Information Systems"},{"key":"jamc.2012100101-53","unstructured":"Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., & Whitley, C. (1991). A comparison of genetic sequencing operators. In Proceedings of the International Conference on Genetic Algorithms (pp. 69-76)."},{"key":"jamc.2012100101-54","unstructured":"Stutzle, T. (1998). Applying iterated local search to the permutation flow shop problem (Tech. Rep. No. AIDA-98-04). Darmstadt, Germany: FG Intellektik, TU Darmstadt."},{"key":"jamc.2012100101-55","first-page":"332","article-title":"Schedule optimization using genetic algorithms","author":"G.Syswerda","year":"1991","journal-title":"Handbook of genetic algorithms"},{"key":"jamc.2012100101-56","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90090-X"},{"key":"jamc.2012100101-57","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"jamc.2012100101-58","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"jamc.2012100101-59","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.024"},{"key":"jamc.2012100101-60","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0020-T"},{"key":"jamc.2012100101-61","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2006910"},{"key":"jamc.2012100101-62","unstructured":"Xie, X.-F., Smith, S. F., Lu, L., & Barlow, G. J. (2011). Schedule-driven intersection control (Tech. Rep. No. CMU-RI-TR-11-34). Pittsburgh, PA: The Robotics Institute, Carnegie Mellon University."},{"key":"jamc.2012100101-63","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.075"},{"key":"jamc.2012100101-64","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.03.035"},{"key":"jamc.2012100101-65","doi-asserted-by":"crossref","unstructured":"Yu, L., & Nickerson, J. (2011). Cooks or cobblers? Crowd creativity through combination. In Proceedings of the Annual Conference on Human Factors in Computing Systems, Vancouver, BC, Canada (pp. 1393-1402).","DOI":"10.1145\/1978942.1979147"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=74736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:48:15Z","timestamp":1654094895000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2012100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2012100101","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}