{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:40:55Z","timestamp":1777696855461,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Intelligent Decision Technologies"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>The dung beetle algorithm, when applied to complex multimodal function problems, tends to fall into local optima and may converge prematurely to suboptimal solutions, thereby restricting its application in high-dimensional and complex optimization issues. To address these limitations, a new dynamic weight adjustment mechanism and escape strategy have been introduced. Through the solution and comparison of 12 benchmark test functions, the improved dung beetle optimization algorithm (DGDBO) has demonstrated enhanced global search capabilities and resistance to premature convergence. This is evidenced by comparison results with other popular optimization algorithms. The improved optimization algorithm was applied in predicting the effectiveness of foam drainage gas recovery measures, the LightGBM prediction model and BiLSTM time series model optimized by DGDBO are established. Experimental results show that the DGDBO model can quickly and accurately identify the optimal parameters of the model, and significantly improve the accuracy and efficiency of the model prediction. This verifies the effectiveness of the DGDBO algorithm and shows its potential in practical engineering applications.<\/jats:p>","DOI":"10.1177\/18724981241295939","type":"journal-article","created":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T09:51:32Z","timestamp":1747734692000},"page":"1142-1157","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiency prediction of foam drainage measures using enhanced dung beetle optimization"],"prefix":"10.1177","volume":"19","author":[{"given":"Xiaohua","family":"Tan","sequence":"first","affiliation":[{"name":"School of Oil and Gas Engineering, Southwest Petroleum University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Oil and Gas Engineering, Southwest Petroleum University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Oil and Gas Engineering, Southwest Petroleum University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyan","family":"Mei","sequence":"additional","affiliation":[{"name":"Exploration and Development Research Institute, PetroChina Southwest Oil &amp; Gasfield Company, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhelun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Exploration and Development Research Institute, PetroChina Southwest Oil &amp; Gasfield Company, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"e_1_3_2_4_2","first-page":"213","article-title":"Horse herd optimization algorithm: a nature-inspired algorithm for high-dimensional optimization problems","author":"MiarNaeimi F","year":"2021","unstructured":"MiarNaeimi F, Azizyan G, Rashki M. Horse herd optimization algorithm: a nature-inspired algorithm for high-dimensional optimization problems. Knowledge-Based Syst 2021: 213.","journal-title":"Knowledge-Based Syst"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/s22030855"},{"key":"e_1_3_2_6_2","volume-title":"Ant colony optimization algorithm and its application2nd International conference on applied mathematics, modelling, and intelligent computing (CAMMIC)","author":"Chen AR","year":"2022","unstructured":"Chen AR, Tan H, Zhu YY (eds) Ant colony optimization algorithm and its application. In: 2nd International conference on applied mathematics, modelling, and intelligent computing (CAMMIC), 25\u201327 March 2022. Electr Network, 2022."},{"key":"e_1_3_2_7_2","first-page":"212","article-title":"The wolf colony algorithm and its application","volume":"20","author":"Liu CG","year":"2011","unstructured":"Liu CG, Yan XH, Liu CY, et\u00a0al. The wolf colony algorithm and its application. Chin J\u00a0Electron 2011; 20: 212\u2013216.","journal-title":"Chin J\u00a0Electron"},{"key":"e_1_3_2_8_2","volume-title":"Firefly algorithms for multimodal optimization5th International symposium on stochastic algorithms - foundations and applications","author":"Yang XS","year":"2009","unstructured":"Yang XS (ed) Firefly algorithms for multimodal optimization. In: 5th International symposium on stochastic algorithms - foundations and applications, 26\u201328 October 2009. Sapporo, Japan: Hokkaido Univ, 2009."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3343-2"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.3390\/s21041224"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.06.003"},{"issue":"1","key":"e_1_3_2_12_2","first-page":"3418269","article-title":"Multistrategy improved whale optimization algorithm and its application","volume":"2022","author":"Liu LS","year":"2022","unstructured":"Liu LS, Zhang RS. Multistrategy improved whale optimization algorithm and its application. Comput Intell Neurosci 2022; 2022(1): 3418269.","journal-title":"Comput Intell Neurosci"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04959-6"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-36620-4"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym15071432"},{"key":"e_1_3_2_16_2","article-title":"Robot path planning based on improved dung beetle optimizer algorithm","volume":"46","author":"He JC","year":"2024","unstructured":"He JC, Fu LH. Robot path planning based on improved dung beetle optimizer algorithm. J Braz Soc Mech Sci Eng 2024; 46(4): 235.","journal-title":"J Braz Soc Mech Sci Eng"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.3390\/math12071084"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10553-021-01212-3"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1080\/01932691.2021.1915160"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11053-023-10249-6"}],"container-title":["Intelligent Decision Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981241295939","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18724981241295939","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981241295939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:08Z","timestamp":1777454468000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18724981241295939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1177\/18724981241295939"],"URL":"https:\/\/doi.org\/10.1177\/18724981241295939","relation":{},"ISSN":["1872-4981","1875-8843"],"issn-type":[{"value":"1872-4981","type":"print"},{"value":"1875-8843","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]}}}