{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:28:21Z","timestamp":1769185701942,"version":"3.49.0"},"reference-count":99,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"content-version":"vor","delay-in-days":283,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/100007194","name":"Universidad de Santiago de Chile","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007194","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. This research addresses the metaheuristics of marriage in honey\u2010bees optimization (MBO) based on the behavior of bees. The current study proposes a technique for solving combinatorial optimization problems within proper computation times. The purpose of this study focuses on the travelling salesperson problem and the application of chaotic methods in important sections of the MBO metaheuristic. Three experiments were conducted to measure the efficiency and quality of the solutions: (1) MBO with chaos to generate initial solutions (MBO2); (2) MBO with chaos in the workers (MBO3); and (3) MBO with chaos to generate initial solutions and the workers (MBO4). The application of chaotic functions in MBO was significantly better at solving the travelling salesperson problem.<\/jats:p>","DOI":"10.1155\/2022\/8903005","type":"journal-article","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:20:44Z","timestamp":1665530444000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5695-3025","authenticated-orcid":false,"given":"Pedro","family":"Palominos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1633-8853","authenticated-orcid":false,"given":"Miguel","family":"Alfaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3044-5919","authenticated-orcid":false,"given":"Guillermo","family":"Fuertes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4161-6621","authenticated-orcid":false,"given":"Manuel","family":"Vargas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3867-2438","authenticated-orcid":false,"given":"Mauricio","family":"Camargo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8649-5694","authenticated-orcid":false,"given":"Victor","family":"Parada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1816-6856","authenticated-orcid":false,"given":"Gustavo","family":"Gatica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.48.3.20627"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9486-6"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.33383\/2019-029"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2020.110434"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-020-01545-8"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.crme.2019.11.006"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.3390\/math9212750"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.01.001"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/02522667.2020.1724614"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-013-0128-0"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2970236"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0002-0"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2007.09.063"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_10"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1577565"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"e_1_2_8_18_2","doi-asserted-by":"crossref","unstructured":"FuertesG. AlfaroM. SotoI. CarrascoR. IturraldeD. andLagosC. Optimization model for location of RFID antennas in a supply chain Proceedings of the International Conference on Computers Communications and Control May 2018 Oradea Romania 203\u2013209 https:\/\/doi.org\/10.1109\/ICCCC.2018.8390459 2-s2.0-85050165105.","DOI":"10.1109\/ICCCC.2018.8390459"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1801-261"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-983-1_15"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_2_8_22_2","volume-title":"Manufacturing Engineering Centre,","author":"Pham D.","year":"2005"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:20030383"},{"key":"e_1_2_8_25_2","doi-asserted-by":"crossref","unstructured":"SatoT.andHagiwaraM. Bee system: finding solution by a concentrated search Proceedings of the International Conference on Systems Man and Cybernetics. Computational Cybernetics and Simulation October 1997 Orlando FL USA 3954\u20133959 https:\/\/doi.org\/10.1109\/ICSMC.1997.633289.","DOI":"10.1109\/ICSMC.1997.633289"},{"key":"e_1_2_8_26_2","volume-title":"Preprints of the TRISTAN IV Triennial Symposium on Transportation Analysis","author":"Lucic P.","year":"2001"},{"key":"e_1_2_8_27_2","volume-title":"Studies in Computational Intelligence","author":"Teodorovi\u0107 D.","year":"2009"},{"key":"e_1_2_8_28_2","doi-asserted-by":"crossref","unstructured":"WeddeH. F. MuddassarF. ThorstenP. BjoernV. ChristianM. JohannesM. andReneJ. BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior Proceedings of the Genetic and Evolutionary Computation Conference June 2005 Washington DC USA 153\u2013160.","DOI":"10.1145\/1068009.1068034"},{"key":"e_1_2_8_29_2","volume-title":"Handbook of Bioinspired Algorithms and Applications","author":"Wedde H. F.","year":"2005"},{"key":"e_1_2_8_30_2","doi-asserted-by":"crossref","unstructured":"AbbassH. A. MBO: marriage in honey bees optimization - a haplometrosis polygynous swarming approach Proceedings of the International Congress on Evolutionary Computation May 2001 Seoul Korea 207\u2013214 https:\/\/doi.org\/10.1109\/CEC.2001.934391.","DOI":"10.1109\/CEC.2001.934391"},{"key":"e_1_2_8_31_2","volume-title":"The Genetic and Evolutionary Computation Conference,","author":"Abbass H. A.","year":"2001"},{"key":"e_1_2_8_32_2","unstructured":"Bozorg HaddadO.andAfsharA. MBO (marriage bees optimization) a new heuristic approach in hydrosystems design and operation Proceedings of the 1st International Conference on Managing Rivers in the 21st Century: Issues and Challenges September 2004 Penang Malaysia 499\u2013504."},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-005-9001-3"},{"key":"e_1_2_8_34_2","doi-asserted-by":"crossref","unstructured":"YangC. ChenJ. andTuX. Algorithm of fast marriage in honey bees optimization and convergence analysis Proceedings of the International Conference on Automation and Logistics August 2007 Jinan China 1794\u20131799 https:\/\/doi.org\/10.1109\/ICAL.2007.4338865 2-s2.0-40649129291.","DOI":"10.1109\/ICAL.2007.4338865"},{"key":"e_1_2_8_35_2","doi-asserted-by":"publisher","DOI":"10.2507\/ijsimm06(3)2.087"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1142\/s146902680300094x"},{"key":"e_1_2_8_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcde.2019.04.004"},{"key":"e_1_2_8_38_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8692146"},{"key":"e_1_2_8_39_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1452683"},{"key":"e_1_2_8_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/tla.2015.7350066"},{"key":"e_1_2_8_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.03.114"},{"key":"e_1_2_8_42_2","doi-asserted-by":"publisher","DOI":"10.5815\/ijisa.2013.05.03"},{"key":"e_1_2_8_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2021.106512"},{"key":"e_1_2_8_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05347-y"},{"key":"e_1_2_8_45_2","doi-asserted-by":"publisher","DOI":"10.1080\/21693277.2019.1602486"},{"key":"e_1_2_8_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2018.03.174"},{"key":"e_1_2_8_47_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.5048299"},{"key":"e_1_2_8_48_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/4392036"},{"key":"e_1_2_8_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.062"},{"key":"e_1_2_8_50_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1656842"},{"key":"e_1_2_8_51_2","doi-asserted-by":"publisher","DOI":"10.1080\/13873954.2019.1705496"},{"key":"e_1_2_8_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2020.3002568"},{"key":"e_1_2_8_53_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/7476250"},{"key":"e_1_2_8_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.06.004"},{"key":"e_1_2_8_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.02.008"},{"key":"e_1_2_8_56_2","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-179543"},{"key":"e_1_2_8_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2019.109498"},{"key":"e_1_2_8_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.08.090"},{"key":"e_1_2_8_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-32-9796-8_9"},{"key":"e_1_2_8_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2018.11.014"},{"key":"e_1_2_8_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3005661"},{"key":"e_1_2_8_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105568"},{"key":"e_1_2_8_63_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2019.101047"},{"key":"e_1_2_8_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3153493"},{"key":"e_1_2_8_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.126"},{"key":"e_1_2_8_66_2","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009"},{"key":"e_1_2_8_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2991076"},{"key":"e_1_2_8_68_2","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1678403"},{"key":"e_1_2_8_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85984-0_62"},{"key":"e_1_2_8_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.08.166"},{"key":"e_1_2_8_71_2","first-page":"64","article-title":"An agent based approach to 3-SAT using marriage in honey-bees optimization","volume":"6","author":"Abbass H. A.","year":"2002","journal-title":"Int. J. Knowledge-based Intell. Eng. Syst.,"},{"key":"e_1_2_8_72_2","unstructured":"TeoJ.andAbbassH. A. An Annealing Approach to the Mating-Flight Trajectories in the Marriage in Honey Bees Optimization Algorithm 2001 School of Computer Science University of New South Wales at ADFA Canberra Australia Technical Report CA04\/01."},{"key":"e_1_2_8_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-017-0230-9"},{"key":"e_1_2_8_74_2","doi-asserted-by":"publisher","DOI":"10.1177\/1729881420925236"},{"key":"e_1_2_8_75_2","first-page":"27","article-title":"Marriage in honey bees optimization algorithm for flow-shop problems","volume":"16","author":"Palominos P.","year":"2012","journal-title":"Informatica Economica"},{"key":"e_1_2_8_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-10015-1"},{"key":"e_1_2_8_77_2","doi-asserted-by":"crossref","unstructured":"Vakil-BaghmishehM. T.andSalimM. A modified fast marriage in honey bee optimization algorithm Proceedings of the International Symposium on Telecommunications December 2010 Tehran Iran 950\u2013955 https:\/\/doi.org\/10.1109\/ISTEL.2010.5734159 2-s2.0-79953856893.","DOI":"10.1109\/ISTEL.2010.5734159"},{"key":"e_1_2_8_78_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3006197"},{"key":"e_1_2_8_79_2","first-page":"4123","article-title":"A marriage in honey bee optimisation approach to the asymmetric travelling salesman problem","volume":"8","author":"\u00c7elik Y.","year":"2012","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"e_1_2_8_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-018-9270-1"},{"key":"e_1_2_8_81_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2014.10.044"},{"key":"e_1_2_8_82_2","doi-asserted-by":"publisher","DOI":"10.1002\/dac.4259"},{"key":"e_1_2_8_83_2","doi-asserted-by":"publisher","DOI":"10.4018\/ijncr.2015070101"},{"key":"e_1_2_8_84_2","unstructured":"MazoM. Programaci\u00f3n de tareas en una m\u00e1quina: un enfoque mediante la metaheur\u00edstica MBO 2009 University of Santiago de Chile Santiago RM Chile Master thesis."},{"key":"e_1_2_8_85_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0166-218x(01)00195-0"},{"key":"e_1_2_8_86_2","volume-title":"Heuristics for the Traveling Salesman Problem","author":"Nilsson C.","year":"2003"},{"key":"e_1_2_8_87_2","doi-asserted-by":"crossref","unstructured":"LiY. YaoD. ChenW. ZhengJ. andYaoJ. Adaptive particle swarm optimizer for beam angle selection in radiotherapy planning Proceedings of the International Conference on Mechatronics and Automation July 2005 Niagara Falls ON Canada 421\u2013425 https:\/\/doi.org\/10.1109\/ICMA.2005.1626584.","DOI":"10.1109\/ICMA.2005.1626584"},{"key":"e_1_2_8_88_2","unstructured":"AbbassH. A. A monogenous MBO approach to satisfiability Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation 2001 Vienna Austria."},{"key":"e_1_2_8_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf01009452"},{"key":"e_1_2_8_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0893-6080(02)00017-5"},{"key":"e_1_2_8_91_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.5.955"},{"key":"e_1_2_8_92_2","volume-title":"Local Search in Combinatorial Optimization","author":"Johnson D. S.","year":"1997"},{"key":"e_1_2_8_93_2","doi-asserted-by":"publisher","DOI":"10.1109\/tla.2015.7164223"},{"key":"e_1_2_8_94_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2020.108533"},{"key":"e_1_2_8_95_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2003.12.032"},{"key":"e_1_2_8_96_2","unstructured":"AonoS. NishioY. andHasegawaM. Effect of chaos noise for tabu search neural network with 2-opt for TSPs Proceedings of the International Workshop on Nonlinear Circuit and Signal Processing 2004 Rome Italy 141\u2013143."},{"key":"e_1_2_8_97_2","doi-asserted-by":"crossref","unstructured":"ZuoX. Q.andFanY. S. Solving the job shop scheduling problem by an immune algorithm Proceedings of the International Conference on Machine Learning and Cybernetics 2005 Toyama Japan 3282\u20133287.","DOI":"10.1109\/ICMLC.2005.1527509"},{"key":"e_1_2_8_98_2","unstructured":"ReineltG. TSPLIB 2021 http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/."},{"key":"e_1_2_8_99_2","unstructured":"PalominosP. ParadaV. AlfaroM. OrtegaC. andGaticaG. Chaotic methods applied to the marriage in honey bees optimization metaheuristic Proceedings of the International Conference on Production Research: Innovation in Product and Production 2011 Chicago Illinois."}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/8903005","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/2022\/8903005","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/8903005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:08:24Z","timestamp":1769116104000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/8903005"}},"subtitle":[],"editor":[{"given":"Jesus M.","family":"Munoz-Pacheco","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":99,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/8903005"],"URL":"https:\/\/doi.org\/10.1155\/2022\/8903005","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-03-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8903005"}}