{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:47:29Z","timestamp":1761598049321,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T00:00:00Z","timestamp":1552262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806138","U1636220","61663028"],"award-info":[{"award-number":["61806138","U1636220","61663028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific and Technological innovation Team of Shanxi Provence","award":["201801D121127"],"award-info":[{"award-number":["201801D121127"]}]},{"name":"PhD Research Stratup Foundation of Taiyuan University of Science and Technology","award":["20182002"],"award-info":[{"award-number":["20182002"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["201601D011045"],"award-info":[{"award-number":["201601D011045"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the real word, optimization problems in multi-objective optimization (MOP) and dynamic optimization can be seen everywhere. During the last decade, among various swarm intelligence algorithms for multi-objective optimization problems, glowworm swarm optimization (GSO) and bacterial foraging algorithm (BFO) have attracted increasing attention from scholars. Although many scholars have proposed improvement strategies for GSO and BFO to keep a good balance between convergence and diversity, there are still many problems to be solved carefully. In this paper, a new coupling algorithm based on GSO and BFO (MGSOBFO) is proposed for solving dynamic multi-objective optimization problems (dMOP). MGSOBFO is proposed to achieve a good balance between exploration and exploitation by dividing into two parts. Part I is in charge of exploitation by GSO and Part II is in charge of exploration by BFO. At the same time, the simulation binary crossover (SBX) and polynomial mutation are introduced into the MGSOBFO to enhance the convergence and diversity ability of the algorithm. In order to show the excellent performance of the algorithm, we experimentally compare MGSOBFO with three algorithms on the benchmark function. The results suggests that such a coupling algorithm has good performance and outperforms other algorithms which deal with dMOP.<\/jats:p>","DOI":"10.3390\/a12030061","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:49:31Z","timestamp":1552362571000},"page":"61","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Novel Coupling Algorithm Based on Glowworm Swarm Optimization and Bacterial Foraging Algorithm for Solving Multi-Objective Optimization Problems"],"prefix":"10.3390","volume":"12","author":[{"given":"Yechuang","family":"Wang","sequence":"first","affiliation":[{"name":"Complex System and Computational Intelligent Laboratory, Taiyuan University of Science and Technology, Taiyuan 030024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Cui","sequence":"additional","affiliation":[{"name":"Complex System and Computational Intelligent Laboratory, Taiyuan University of Science and Technology, Taiyuan 030024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wuchao","family":"Li","sequence":"additional","affiliation":[{"name":"Jiaxing Vocational Technical College, Jiaxing 314001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,11]]},"reference":[{"key":"ref_1","first-page":"117","article-title":"Unexpected failure of a Greedy choice Algorithm Proposed by Hoffman","volume":"12","author":"Heller","year":"2017","journal-title":"Int. J. Math. Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1504\/IJCSM.2016.081693","article-title":"A two-level particle swarm optimization algorithm for open-shop scheduling problem","volume":"7","author":"Pisut","year":"2016","journal-title":"Int. J. Comput. Sci. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","article-title":"Discrete differential evolutions for the discounted {0-1} knapsack problem","volume":"10","author":"Zhu","year":"2017","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"ref_4","unstructured":"Fourman, M.P. (1985, January 24\u201326). Compaction of Symbolic Layout using Genetic Algorithms. Genetic Algorithms and Their Applications. In Proceedings of the First Internation Conference on Genetic Algorithms, Pittsburg, PA, USA."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","article-title":"Differential Evolution: A Survey of the State-of-the-Art","volume":"15","author":"Das","year":"2011","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ins.2016.09.026","article-title":"Many Objective Particle Swarm Optimization","volume":"374","author":"Figueiredo","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1504\/IJBIC.2018.096484","article-title":"A discrete particle swarm optimisation algorithm to operate distributed energy generation networks efficiently","volume":"12","author":"Onieva","year":"2018","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","article-title":"A best-path-updating information-guided ant colony optimization algorithm","volume":"433\u2013434","author":"Ning","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/j.ins.2014.04.013","article-title":"Multi-strategy ensemble artificial bee colony algorithm","volume":"279","author":"Wang","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Cui, Z., Zhang, J., Wang, Y., Cao, Y., Cai, X., Zhang, W., and Chen, J. (2019). A pigeon-inspired optimization algorithm for many-objective optimization problems. Sci. China Inf. Sci.","DOI":"10.1007\/s11432-018-9729-5"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1504\/IJBIC.2016.078666","article-title":"Improved bat algorithm with optimal forage strategy and random disturbance strategy","volume":"8","author":"Cai","year":"2016","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Cui, Z., Li, F., and Zhang, W. (2018). Bat algorithm with principal component analysis. Int. J. Mach. Learn. Cybern.","DOI":"10.1007\/s13042-018-0888-4"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ins.2016.04.046","article-title":"Bacterial foraging optimization using novel chemotaxis and conjugation strategies","volume":"363","author":"Yang","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s12293-017-0237-2","article-title":"Hybrid multi-objective cuckoo search with dynamical local search","volume":"10","author":"Zhang","year":"2018","journal-title":"Memet. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jpdc.2016.10.011","article-title":"A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems","volume":"103","author":"Cui","year":"2017","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1504\/IJCSM.2018.10011723","article-title":"An improved cuckoo search algorithm for integer programming problems","volume":"9","author":"Zhou","year":"2018","journal-title":"Int. J. Comput. Sci. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1080\/0305215X.2017.1361418","article-title":"Hybrid glowworm swarm optimization for task scheduling in the cloud environment","volume":"50","author":"Zhou","year":"2018","journal-title":"Eng. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1504\/IJCSM.2018.091749","article-title":"Improving firefly algorithm using hybrid strategies","volume":"9","author":"Yu","year":"2018","journal-title":"Int. J. Comput. Sci. Math."},{"key":"ref_19","unstructured":"Cui, Z., Cao, Y., Cai, X., Cai, J., and Chen, J. (2017). Optimal LEACH protocol with modified bat algorithm for big data sensing systems in Internet of Things. J. Parallel Distrib. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s13042-017-0739-8","article-title":"Bat algorithm with triangle-flipping strategy for numerical optimization","volume":"9","author":"Cai","year":"2018","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","article-title":"Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms","volume":"2","author":"Srinivas","year":"1994","journal-title":"Evolut. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A Multiobjective Evolutionary Algorithm Based on Decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_24","unstructured":"Horn, J., Nafpliotis, N., and Goldberg, D.E. (2002, January 12\u201317). A niched Pareto genetic algorithm for multiobjective optimization. Proceedings of the IEEE Conference on Evolutionary Computation IEEE World Congress on Computational Intelligence, Honolulu, HI, USA."},{"key":"ref_25","unstructured":"Zitzler, E., Laumanns, M., and Thiele, L. (2002). SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. Evolutionary Methods for Design, Optimization and Control with Applications To Industrial Problems, Proceedings of the Eurogen 2001, Athens, Greece, 19\u201321 September2001, International Center for Numerical Methods in Engineering."},{"key":"ref_26","unstructured":"Yuan, J., Gang, X., Zhen, Z., and Chen, B. (, January 1\u20135). The pareto optimal control of inverter based on multi-objective immune algorithm. Proceedings of theInternational Conference on Power Electronics & Ecce Asia, Seoul, Korea."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1080\/0305215X.2010.493937","article-title":"Constrained Multi-Objective Optimization Algorithm with Ensemble of Constraint Handling Methods","volume":"43","author":"Qu","year":"2011","journal-title":"Eng. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","article-title":"Evolutionary optimization in uncertain environments-a survey","volume":"9","author":"Jin","year":"2005","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-008-0003-6","article-title":"Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization","volume":"1","author":"Yu","year":"2009","journal-title":"Memet. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, M., Zhu, Z., Cui, Z., and Cai, X. (2017, January 28\u201330). NSGA-II with local perturbation. Proceedings of the Control & Decision Conference, Chongqing, China.","DOI":"10.1109\/CCDC.2017.7978093"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of Multiobjective Evolutionary Algorithm: Empirical Results","volume":"8","author":"Zitzle","year":"2000","journal-title":"Evolut. Comput."},{"key":"ref_33","unstructured":"Schaffer, J.D. Multiple objective optimization with vector evaluated genetic algorithms. Proceedings of the First International Conference on Genetic Algorithms and Their Applications."},{"key":"ref_34","first-page":"1","article-title":"Fault tolerant design using single and multicriteria genetic algorithm optimization","volume":"37","author":"Schott","year":"1995","journal-title":"Cell. Immunol."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Mohammadi, A., Omidvar, M.N., and Li, X. (2013, January 20\u201323). A new performance metric for user-preference based on multi-objective evolutionary algorithms. Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico.","DOI":"10.1109\/CEC.2013.6557912"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/3\/61\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:38:00Z","timestamp":1760186280000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/3\/61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,11]]},"references-count":35,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["a12030061"],"URL":"https:\/\/doi.org\/10.3390\/a12030061","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,3,11]]}}}