{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:42:03Z","timestamp":1754156523893,"version":"3.41.2"},"reference-count":39,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6,13]]},"abstract":"<jats:sec>\n               <jats:title content-type=\"abstract-heading\">Purpose<\/jats:title>\n               <jats:p> \u2013 The purpose of this paper is to examine and compare the entire impact of various execution skills of oppositional biogeography-based optimization using the current optimum (COOBBO) algorithm. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title>\n               <jats:p> \u2013 The improvement measures tested in this paper include different initialization approaches, crossover approaches, local optimization approaches, and greedy approaches. Eight well-known traveling salesman problems (TSP) are employed for performance verification. Four comparison criteria are recoded and compared to analyze the contribution of each modified method. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Findings<\/jats:title>\n               <jats:p> \u2013 Experiment results illustrate that the combination model of \u201c25 nearest-neighbor algorithm initialization+inver-over crossover+2-opt+all greedy\u201d may be the best choice of all when considering both the overall algorithm performance and computation overhead. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title>\n               <jats:p> \u2013 When solving TSP with varying scales, these modified methods can enhance the performance and efficiency of COOBBO algorithm in different degrees. And an appropriate combination model may make the fullest possible contribution.<\/jats:p>\n            <\/jats:sec>","DOI":"10.1108\/ijicc-03-2016-0015","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T06:02:38Z","timestamp":1467612158000},"page":"144-164","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems"],"prefix":"10.1108","volume":"9","author":[{"given":"Qingzheng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020121502253300800_b1","doi-asserted-by":"crossref","unstructured":"Ababneh, J.\n                (2015), \u201cGreedy particle swarm and biogeography-based optimization algorithm\u201d, \n                  International Journal of Intelligent Computing and Cybernetics\n               , Vol. 8 No. 1, pp. 28-49.","DOI":"10.1108\/IJICC-01-2014-0003"},{"key":"key2020121502253300800_b2","unstructured":"Cai, Z.H.\n               , \n                  Gong, W.Y.\n                and \n                  Ling, C.X.\n                (2010), \u201cResearch on a novel biogeography-based optimization algorithm based on evolutionary programming\u201d, \n                  System Engineering Theory and Practice\n               , Vol. 30 No. 6, pp. 1106-1112 (in Chinese)."},{"key":"key2020121502253300800_b3","doi-asserted-by":"crossref","unstructured":"Cover, T.\n                and \n                  Hart, P.\n                (1967), \u201cNearest neighbor pattern classification\u201d, \n                  IEEE Transactions on Information Theory\n               , Vol. 13 No. 1, pp. 21-27.","DOI":"10.1109\/TIT.1967.1053964"},{"key":"key2020121502253300800_b4","doi-asserted-by":"crossref","unstructured":"Crepinsek, M.\n               , \n                  Liu, S.H.\n                and \n                  Mernik, M.\n                (2013), \u201cExploration and exploitation in evolutionary algorithms: a survey\u201d, \n                  ACM Computing Surveys\n               , Vol. 45 No. 35, pp. 1-35.","DOI":"10.1145\/2480741.2480752"},{"key":"key2020121502253300800_b5","doi-asserted-by":"crossref","unstructured":"Croes, G.A.\n                (1958), \u201cA method for solving traveling-salesman problems\u201d, \n                  Operations Research\n               , Vol. 6 No. 6, pp. 791-812.","DOI":"10.1287\/opre.6.6.791"},{"key":"key2020121502253300800_b6","unstructured":"Du, D.\n                (2014), \u201cBiogeography-based optimization for combinatorial problems and complex systems\u201d, PhD dissertation, Cleveland State University, Cleveland, OH."},{"key":"key2020121502253300800_b7","doi-asserted-by":"crossref","unstructured":"Du, D.\n                and \n                  Simon, D.\n                (2013), \u201cBiogeography-based optimization for large scale combinatorial problems\u201d, in \n                  Igelnik, B.\n                and \n                  Zurada, J.\n                (Eds), \n                  Efficiency and Scalability Methods for Computational Intellect\n               , IGI Global, Hershey, PA, pp. 197-217.","DOI":"10.4018\/978-1-4666-3942-3.ch010"},{"key":"key2020121502253300800_b8","doi-asserted-by":"crossref","unstructured":"Ergezer, M.\n                and \n                  Simon, D.\n                (2011), \u201cOppositional biogeography-based optimization for combinatorial problems\u201d, Proceedings of IEEE Congress on Evolutionary Computation, New Orleans, LA, pp. 1496-1503.","DOI":"10.1109\/CEC.2011.5949792"},{"key":"key2020121502253300800_b9","doi-asserted-by":"crossref","unstructured":"Ergezer, M.\n                and \n                  Simon, D.\n                (2014), \u201cMathematical and experimental analyses of oppositional algorithms\u201d, \n                  IEEE Transactions on Cybernetics\n               , Vol. 44 No. 11, pp. 2178-2189.","DOI":"10.1109\/TCYB.2014.2303117"},{"key":"key2020121502253300800_b10","doi-asserted-by":"crossref","unstructured":"Ergezer, M.\n                and \n                  Simon, D.\n                (2015), \u201cProbabilistic properties of fitness-based quasi-reflection in evolutionary algorithms\u201d, \n                  Computers & Operations Research\n               , Vol. 63 No. 1, pp. 114-124.","DOI":"10.1016\/j.cor.2015.03.013"},{"key":"key2020121502253300800_b11","doi-asserted-by":"crossref","unstructured":"Feng, Q.X.\n               , \n                  Liu, S.Y.\n               , \n                  Zhang, J.K.\n               , \n                  Yang, G.P.\n                and \n                  Yong, L.Q.\n                (2014), \u201cBiogeography-based optimization with improved migration operator and self-adaptive clear duplicate operator\u201d, \n                  Applied Intelligence\n               , Vol. 41 No. 2, pp. 563-581.","DOI":"10.1007\/s10489-014-0527-z"},{"key":"key2020121502253300800_b12","doi-asserted-by":"crossref","unstructured":"Fox, B.\n                and \n                  McMahon, M.\n                (1991), \u201cGenetic operators for sequencing problem\u201d, in \n                  Rawlins, G.\n                (Ed.), \n                  Foundations of Genetic Algorithms\n               , Morgan Kaufmann, Burlington, MA, pp. 284-300.","DOI":"10.1016\/B978-0-08-050684-5.50021-5"},{"key":"key2020121502253300800_b13","doi-asserted-by":"crossref","unstructured":"Gong, W.\n               , \n                  Cai, Z.\n                and \n                  Ling, C.\n                (2010), \u201cDE\/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization\u201d, \n                  Soft Computing\n               , Vol. 15 No. 4, pp. 645-665.","DOI":"10.1007\/s00500-010-0591-1"},{"key":"key2020121502253300800_b14","doi-asserted-by":"crossref","unstructured":"Gutin, G.\n                and \n                  Punnen, A.P.\n                (2007), \n                  The Traveling Salesman Problem and its Variations\n               , Springer, New York, NY.","DOI":"10.1007\/b101971"},{"key":"key2020121502253300800_b15","doi-asserted-by":"crossref","unstructured":"Gutin, G.\n               , \n                  Yeo, A.\n                and \n                  Zverovich, A.\n                (2002), \u201cTraveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP\u201d, \n                  Discrete Applied Mathematics\n               , Vol. 117 Nos 1-3, pp. 81-86.","DOI":"10.1016\/S0166-218X(01)00195-0"},{"key":"key2020121502253300800_b16","doi-asserted-by":"crossref","unstructured":"Lin, S.\n                (1965), \u201cComputer solutions of the traveling salesman problem\u201d, \n                  Bell System Technical Journal\n               , Vol. 44 No. 10, pp. 2245-2269.","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"key2020121502253300800_b18","unstructured":"MacArthur, R.\n                and \n                  Wilson, E.\n                (1967), \n                  The Theory of Biogeography\n               , Princeton University Press, Princeton, NJ."},{"key":"key2020121502253300800_b17","doi-asserted-by":"crossref","unstructured":"Ma, H.\n                and \n                  Simon, D.\n                (2011), \u201cBlended biogeography-based optimization for constrained optimization\u201d, \n                  Engineering Applications of Artificial Intelligence\n               , Vol. 24 No. 3, pp. 517-525.","DOI":"10.1016\/j.engappai.2010.08.005"},{"key":"key2020121502253300800_b19","doi-asserted-by":"crossref","unstructured":"Maekawa, K.\n               , \n                  Mori, N.\n               , \n                  Tamaki, H.\n               , \n                  Kita, H.\n                and \n                  Nishikawa, Y.\n                (1996), \u201cA genetic solution for the traveling salesman problem by means of a thermodynamical selection rule\u201d, Proceedings of IEEE International Conference on Evolutionary Computation, Nagoya, pp. 529-534.","DOI":"10.1109\/ICEC.1996.542655"},{"key":"key2020121502253300800_b20","doi-asserted-by":"crossref","unstructured":"Mo, H.M.\n                and \n                  Xu, L.F.\n                (2010), \u201cBiogeography based optimization for traveling salesman problem\u201d, Proceedings of International Conference on Natural Computation, Yantai, pp. 3143-3147.","DOI":"10.1109\/ICNC.2010.5584489"},{"key":"key2020121502253300800_b21","doi-asserted-by":"crossref","unstructured":"Mo, H.M.\n                and \n                  Xu, L.F.\n                (2011), \u201cBiogeography migration algorithm for traveling salesman problem\u201d, \n                  International Journal of Intelligent Computing and Cybernetics\n               , Vol. 4 No. 3, pp. 311-330.","DOI":"10.1108\/17563781111160002"},{"key":"key2020121502253300800_b22","doi-asserted-by":"crossref","unstructured":"Nagata, Y.\n                and \n                  Ono, O.\n                (2013), \u201cHigh-order sequence entropies for measuring population diversity in the traveling salesman problem\u201d, Proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimisation, Vienna, pp. 179-190.","DOI":"10.1007\/978-3-642-37198-1_16"},{"key":"key2020121502253300800_b23","unstructured":"Oliver, I.\n               , \n                  Smith, D.\n                and \n                  Holland, J.\n                (1987), \u201cA study of permutation crossover operators on the traveling salesman problem\u201d, Proceedings of International Conference on Genetic Algorithm and their Application, Mahwah, NJ, pp. 224-230."},{"key":"key2020121502253300800_b24","doi-asserted-by":"crossref","unstructured":"Reinelt, G.\n                (1991), \u201cTSPLIB \u2013 a traveling salesman problem library\u201d, \n                  ORSA Journal on Computing\n               , Vol. 3 No. 4, pp. 376-384.","DOI":"10.1287\/ijoc.3.4.376"},{"key":"key2020121502253300800_b25","doi-asserted-by":"crossref","unstructured":"Salvador, T.\n                and \n                  Morais, M.C.\n                (2014), \u201cThe traveling salesman problem and the Gnedenko theorem\u201d, in \n                  Pacheco, A.\n               , \n                  Santos, R.\n               , \n                  Oliveira, M.R.\n                and \n                  Paulino, C.D.\n                (Eds), \n                  New Advances in Statistical Modeling and Applications\n               , Springer, London, pp. 197-206.","DOI":"10.1007\/978-3-319-05323-3_19"},{"key":"key2020121502253300800_b26","doi-asserted-by":"crossref","unstructured":"Seif, Z.\n                and \n                  Ahmadi, M.B.\n                (2015a), \u201cAn opposition-based algorithm for function optimization\u201d, \n                  Engineering Applications of Artificial Intelligence\n               , Vol. 37 No. 1, pp. 293-306.","DOI":"10.1016\/j.engappai.2014.09.009"},{"key":"key2020121502253300800_b27","doi-asserted-by":"crossref","unstructured":"Seif, Z.\n                and \n                  Ahmadi, M.B.\n                (2015b), \u201cOpposition versus randomness in binary spaces\u201d, \n                  Applied Soft Computing\n               , Vol. 27 No. 1, pp. 28-37.","DOI":"10.1016\/j.asoc.2014.10.038"},{"key":"key2020121502253300800_b28","doi-asserted-by":"crossref","unstructured":"Simon, D.\n                (2008), \u201cBiogeography-based optimization\u201d, \n                  IEEE Transactions on Evolutionary Computation\n               , Vol. 12 No. 6, pp. 702-713.","DOI":"10.1109\/TEVC.2008.919004"},{"key":"key2020121502253300800_b29","doi-asserted-by":"crossref","unstructured":"Simon, D.\n                (2011), \u201cA probabilistic analysis of a simplified biogeography based optimization algorithm\u201d, \n                  Evolutionary Computation\n               , Vol. 19 No. 2, pp. 167-188.","DOI":"10.1162\/EVCO_a_00018"},{"key":"key2020121502253300800_b30","doi-asserted-by":"crossref","unstructured":"Simon, D.\n               , \n                  Rarick, R.\n                and \n                  Ergezer, M.\n                (2011), \u201cAnalytical and numerical comparisons of biogeography-based optimization and genetic algorithms\u201d, \n                  Information Sciences\n               , Vol. 181 No. 7, pp. 1224-1248.","DOI":"10.1016\/j.ins.2010.12.006"},{"key":"key2020121502253300800_b31","doi-asserted-by":"crossref","unstructured":"Song, Y.\n               , \n                  Liu, M.\n                and \n                  Wang, Z.\n                (2010), \u201cBiogeography-based optimization for the traveling salesman problems\u201d, Proceedings of International Joint Conference on Computational Science and Optimization, Huangshan, pp. 295-299.","DOI":"10.1109\/CSO.2010.79"},{"key":"key2020121502253300800_b32","doi-asserted-by":"crossref","unstructured":"Tao, G.\n                and \n                  Michalewicz, Z.\n                (1998), \u201cInver-over operator for the TSP\u201d, Proceedings of Parallel Problem Solving From Nature, pp. 803-812.","DOI":"10.1007\/BFb0056922"},{"key":"key2020121502253300800_b33","doi-asserted-by":"crossref","unstructured":"Tizhoosh, H.R.\n                (2005), \u201cOpposition-based learning: a new scheme for machine intelligence\u201d, Proceedings of International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Vienna, pp. 695-701.","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"key2020121502253300800_b34","doi-asserted-by":"crossref","unstructured":"Xu, H.P.\n               , \n                  Erdbrink, C.D.\n                and \n                  Krzhizhanovskaya, V.V.\n                (2015a), \u201cHow to speed up optimization? Opposite-center learning and its application to differential evolution\u201d, \n                  Procedia Computer Science\n               , Vol. 51 No. 1, pp. 805-814.","DOI":"10.1016\/j.procs.2015.05.203"},{"key":"key2020121502253300800_b36","unstructured":"Xu, Q.Z.\n               , \n                  Wang, L.\n               , \n                  He, B.M.\n                and \n                  Wang, N.\n                (2011a), \u201cModified opposition-based differential evolution for function optimization\u201d, \n                  Journal of Computational Information Systems\n               , Vol. 7 No. 5, pp. 1582-1591."},{"key":"key2020121502253300800_b37","unstructured":"Xu, Q.Z.\n               , \n                  Wang, L.\n               , \n                  He, B.M.\n                and \n                  Wang, N.\n                (2011b), \u201cOpposition-based differential evolution using the current optimum for function optimization\u201d, \n                  Journal of Applied Sciences\n               , Vol. 29 No. 3, pp. 308-315 (in Chinese)."},{"key":"key2020121502253300800_b39","doi-asserted-by":"crossref","unstructured":"Xu, Q.Z.\n               , \n                  Wang, N.\n               , \n                  Zhang, J.H.\n                and \n                  Gu, X.\n                (2015b), \u201cEnhancing the performance of biogeography-based optimization in discrete domain\u201d, Proceedings of International Conference on Swarm Intelligence, Beijing, pp. 403-414.","DOI":"10.1007\/978-3-319-20466-6_43"},{"key":"key2020121502253300800_b35","doi-asserted-by":"crossref","unstructured":"Xu, Q.Z.\n               , \n                  Guo, L.M.\n               , \n                  Wang, N.\n               , \n                  Pan, J.\n                and \n                  Wang, L.\n                (2014a), \u201cA novel oppositional biogeography-based optimization for combinatorial problems\u201d, Proceedings of International Conference on Natural Computation, Xiamen, pp. 414-420.","DOI":"10.1109\/ICNC.2014.6975871"},{"key":"key2020121502253300800_b38","doi-asserted-by":"crossref","unstructured":"Xu, Q.Z.\n               , \n                  Wang, L.\n               , \n                  Wang, N.\n               , \n                  Hei, X.H.\n                and \n                  Zhao, L.\n                (2014b), \u201cA review of opposition-based learning from 2005 to 2012\u201d, \n                  Engineering Applications of Artificial Intelligence\n               , Vol. 29 No. 1, pp. 1-12.","DOI":"10.1016\/j.engappai.2013.12.004"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IJICC-03-2016-0015","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-03-2016-0015\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-03-2016-0015\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:54:10Z","timestamp":1753397650000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/9\/2\/144-164\/135113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6,13]]}},"alternative-id":["10.1108\/IJICC-03-2016-0015"],"URL":"https:\/\/doi.org\/10.1108\/ijicc-03-2016-0015","relation":{},"ISSN":["1756-378X"],"issn-type":[{"type":"print","value":"1756-378X"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}