{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:19:44Z","timestamp":1781108384484,"version":"3.54.1"},"reference-count":70,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>The hybridization of genetic algorithms and the simplex method have been proven in literature as useful and promising in optimizations. Therefore, this paper proposes a multi-teams genetic-algorithm (MT-GA) hybrid developed toward extending the previous simplex-GA hybrids. The approach utilizes the simplex method as a united team and multi-teams collaboration and also competition search process in conjunction with the GAs. It is designed such that it has multi-teams with self-evolution (parallel applications of the simplex method), multi-teams communication and even mutual stimulation, and multi-teams survival competition as well as non-elite team breakup for individual relearning (with GAs) and re-forming the new teams. The extension of multi-teams GA thus provides the advantages and as previous simplex-GAs has been proved to outperform a number of other approaches. The experiments in this research show that the MT-GA generally outperforms the existing simplex-GAs for the indices of convergence rate (CPU time required), efficiency (number of function evaluations), and effectiveness (accuracy). Also, a further functional experiment of the MT-GA shows that the MT-GA can be a useful improved algorithm for the function optimization problems.<\/jats:p>","DOI":"10.4018\/jalr.2010070107","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T15:08:11Z","timestamp":1297782491000},"page":"62-90","source":"Crossref","is-referenced-by-count":1,"title":["Collaboration and Competition Process"],"prefix":"10.4018","volume":"1","author":[{"given":"Ping-Teng","family":"Chang","sequence":"first","affiliation":[{"name":"Tunghai University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chih-Sheng","family":"Lin","sequence":"additional","affiliation":[{"name":"Tunghai University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuo-Chen","family":"Hung","sequence":"additional","affiliation":[{"name":"National Defense University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han-Hsiang","family":"Lee","sequence":"additional","affiliation":[{"name":"Tunghai University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ching-Hsiang","family":"Chang","sequence":"additional","affiliation":[{"name":"Chang Jung Christian University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jalr.2010070107-0","unstructured":"Baker, J. E. (1985). Adaptive selection methods for genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of the First International Conference on Genetic Algorithms (pp. 101-111). Hillsdale, MA: Lawrence Erlbaum Associates."},{"key":"jalr.2010070107-1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430363"},{"key":"jalr.2010070107-2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00093-6"},{"key":"jalr.2010070107-3","doi-asserted-by":"publisher","DOI":"10.1080\/0951120010020749"},{"key":"jalr.2010070107-4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00401-0"},{"key":"jalr.2010070107-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.09.021"},{"key":"jalr.2010070107-6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAPT.2005.848589"},{"key":"jalr.2010070107-7","unstructured":"De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. Dissertation Abstracts International, 36(10), 5140B."},{"key":"jalr.2010070107-8","unstructured":"de Souza, P. S., & Talukdar, S. N. (1991). Genetic algorithm in asynchronous teams. In Proceedings of Fourth International Conference on Genetic Algorithms (pp. 392-397)."},{"key":"jalr.2010070107-9","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760972767"},{"key":"jalr.2010070107-10","unstructured":"Deb, K., & Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In Proceedings of Third International Conference on Genetic Algorithms (pp. 42-50)."},{"key":"jalr.2010070107-11","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"jalr.2010070107-12","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-0417(99)00013-3"},{"key":"jalr.2010070107-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.pecs.2004.02.002"},{"key":"jalr.2010070107-14","doi-asserted-by":"crossref","unstructured":"Ficici, S. G., Melnik, O., & Pollack, J. B. (2000). A game-theoretic investigation of selection methods used in evolutionary algorithms. In Proceedings of the 2000 Congress on Evolutionary Computation (Vol. 2, pp. 880-887). Washington, DC: IEEE Press.","DOI":"10.1109\/CEC.2000.870732"},{"key":"jalr.2010070107-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2006.05.008"},{"key":"jalr.2010070107-16","author":"D. E.Goldberg","year":"1989","journal-title":"Genetic algorithms in search, optimization & machine learning"},{"key":"jalr.2010070107-17","first-page":"69","article-title":"A comparison of selection schemes used in genetic algorithms.","volume":"1","author":"D. E.Goldberg","year":"1991","journal-title":"Foundations of Genetic Algorithms"},{"key":"jalr.2010070107-18","unstructured":"Goldberg, D. E., & Richardson, J. (1987). Genetic algorithm with sharing for multimodal function optimization. In Proceedings of Second International Conference on Genetic Algorithms (pp. 41-49)."},{"key":"jalr.2010070107-19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289288"},{"key":"jalr.2010070107-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(01)00380-2"},{"key":"jalr.2010070107-21","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190398"},{"key":"jalr.2010070107-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-1699(97)00039-2"},{"issue":"3","key":"jalr.2010070107-23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF03546237","article-title":"Optimal interplanetary spacecraft trajectories via a pareto genetic algorithm.","volume":"46","author":"J. W.Hartman","year":"1998","journal-title":"The Journal of the Astronautical Sciences"},{"key":"jalr.2010070107-24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/921622054","article-title":"Minimizing multimodal functions by simplex coding genetic algorithm.","volume":"18","author":"A.-R.Hedar","year":"2003","journal-title":"Optimization Methods and Software"},{"key":"jalr.2010070107-25","author":"J. H.Holland","year":"1975","journal-title":"Adaptation in natural and artificial systems"},{"key":"jalr.2010070107-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2005.09.001"},{"key":"jalr.2010070107-27","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90204-C"},{"key":"jalr.2010070107-28","first-page":"392","article-title":"A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics\u2212Part C","volume":"28","author":"H.Ishibuchi","year":"1998","journal-title":"Applications and Reviews"},{"key":"jalr.2010070107-29","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(94)90210-0"},{"key":"jalr.2010070107-30","unstructured":"Janikow, C. Z., & Michalewicz, Z. (1991). An experimental comparison of binary and floating point representation in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 31-36)."},{"key":"jalr.2010070107-31","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-9978(98)00021-0"},{"key":"jalr.2010070107-32","doi-asserted-by":"publisher","DOI":"10.1080\/03052159808941247"},{"key":"jalr.2010070107-33","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-9978(02)00045-5"},{"key":"jalr.2010070107-34","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(01)00364-0"},{"key":"jalr.2010070107-35","unstructured":"Lobo, F. G. (2000). The parameter-less genetic algorithm: Rational and automated parameter selection for simplified genetic algorithm operation. Unpublished doctoral dissertation, University of Lisbon, Portugal."},{"key":"jalr.2010070107-36","doi-asserted-by":"crossref","unstructured":"Mahfoud, S. W. (1994). Crossover interactions among niches. In Proceedings of First IEEE Conference on Evolutionary Computation (Vol. 1, pp. 188-193).","DOI":"10.1109\/ICEC.1994.350018"},{"key":"jalr.2010070107-37","doi-asserted-by":"publisher","DOI":"10.1016\/S0308-521X(01)00025-7"},{"key":"jalr.2010070107-38","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3800(01)00309-X"},{"key":"jalr.2010070107-39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","author":"Z.Michalewicz","year":"1992","journal-title":"Genetic algorithms + data structures = evolution programs"},{"key":"jalr.2010070107-40","unstructured":"Michalewicz, Z., Logan, T., & Swaminathan, S. (1994). Evolutionary operators for continuous convex parameter spaces. In Proceedings of the Third Annual Conference on Evolutionary Programming (pp. 84-97). Singapore: World Scientific."},{"key":"jalr.2010070107-41","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"M.Mitchell","year":"1996","journal-title":"An introduction to genetic algorithms"},{"key":"jalr.2010070107-42","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(96)00053-8"},{"key":"jalr.2010070107-43","doi-asserted-by":"publisher","DOI":"10.1109\/48.775297"},{"key":"jalr.2010070107-44","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00111-6"},{"key":"jalr.2010070107-45","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","article-title":"A simplex method for function minimization.","volume":"7","author":"J. A.Nelder","year":"1965","journal-title":"The Computer Journal"},{"key":"jalr.2010070107-46","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(98)00043-X"},{"key":"jalr.2010070107-47","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski, A. (1996). A clearing procedure as a niching method for genetic algorithms. In Proceedings of Third IEEE International Conference on Evolutionary Computation (pp. 798-803).","DOI":"10.1109\/ICEC.1996.542703"},{"key":"jalr.2010070107-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2004.03.002"},{"key":"jalr.2010070107-49","author":"S. S.Rao","year":"1996","journal-title":"Engineering optimization: Theory and practice"},{"key":"jalr.2010070107-50","doi-asserted-by":"crossref","unstructured":"Renders, J.-M., & Bersini, H. (1994). Hybridizing genetic algorithms with hill-climbing methods for global optimization: Two possible ways. In Proceedings of First IEEE Conference on Evolutionary Computation (pp. 312-317).","DOI":"10.1109\/ICEC.1994.349948"},{"key":"jalr.2010070107-51","unstructured":"Rogers, D. (1991). G\/SPLINES: A hybrid of Friedman\u2019s multivariate adaptive regression splines (MARS) algorithm with Holland\u2019s genetic algorithm. In Proceedings of Fourth International Conference on Genetic Algorithms (pp. 384-391)."},{"key":"jalr.2010070107-52","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4549(03)00174-9"},{"key":"jalr.2010070107-53","doi-asserted-by":"publisher","DOI":"10.1109\/4235.735432"},{"key":"jalr.2010070107-54","unstructured":"Schaffer, J. D., Caruna, R. A., Eshelman, L. J., & Das, R. (1989). A study of control parameters affecting online performance of genetic algorithms for function optimization. In Proceedings of Third International Conference on Genetic Algorithm (pp. 51-60). New York: Morgan Kaufmann."},{"key":"jalr.2010070107-55","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00406-0"},{"key":"jalr.2010070107-56","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-9978(02)00010-8"},{"key":"jalr.2010070107-57","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.2.127"},{"key":"jalr.2010070107-58","doi-asserted-by":"publisher","DOI":"10.2307\/1266283"},{"key":"jalr.2010070107-59","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruct.2003.09.004"},{"key":"jalr.2010070107-60","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50871-6","author":"A.T\u00f6rn","year":"1989","journal-title":"Global optimization (LNCS 350)"},{"key":"jalr.2010070107-61","doi-asserted-by":"publisher","DOI":"10.1016\/j.aca.2004.12.024"},{"key":"jalr.2010070107-62","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","author":"M. D.Vose","year":"1999","journal-title":"The simple genetic algorithm: Foundations and theory"},{"key":"jalr.2010070107-63","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00079-3"},{"key":"jalr.2010070107-64","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.amc.2003.11.023","article-title":"A niche hybrid genetic algorithm for global optimization of continuous multimodal functions.","volume":"160","author":"L.Wei","year":"2005","journal-title":"Applied Mathematics and Computation"},{"key":"jalr.2010070107-65","author":"C. F. J.Wu","year":"2000","journal-title":"Experiments: Planning, analysis and parameter design optimization"},{"key":"jalr.2010070107-66","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022697719738"},{"key":"jalr.2010070107-67","first-page":"173","article-title":"A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method. IEEE Transactions on Systems, Man, and Cybernetics\u2212Part B","volume":"28","author":"J.Yen","year":"1998","journal-title":"Cybernetics"},{"key":"jalr.2010070107-68","doi-asserted-by":"crossref","unstructured":"Yin, X., & Germay, N. (1993). A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms (pp. 450-457).","DOI":"10.1007\/978-3-7091-7533-0_65"},{"key":"jalr.2010070107-69","first-page":"544","article-title":"Improved response surface method and its application to stiffened plate reliability analysis.","volume":"22","author":"Y.Zheng","year":"2000","journal-title":"Engineering"}],"container-title":["International Journal of Artificial Life Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=46030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T11:48:51Z","timestamp":1740916131000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jalr.2010070107"}},"subtitle":["A Multi-Teams and Genetic Algorithm Hybrid Approach"],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":70,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/jalr.2010070107","relation":{},"ISSN":["1947-3087","1947-3079"],"issn-type":[{"value":"1947-3087","type":"print"},{"value":"1947-3079","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}