{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:51:38Z","timestamp":1782492698501,"version":"3.54.5"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["QTZX25074"],"award-info":[{"award-number":["QTZX25074"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62576220"],"award-info":[{"award-number":["62576220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276202"],"award-info":[{"award-number":["62276202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LHZY24A010005"],"award-info":[{"award-number":["LHZY24A010005"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2026A1515010245"],"award-info":[{"award-number":["2026A1515010245"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cor.2026.107519","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:11:58Z","timestamp":1777097518000},"page":"107519","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Surrogate-assisted evolutionary algorithm with least squares boosting and random multi-neighborhood search for expensive binary optimization"],"prefix":"10.1016","volume":"193","author":[{"given":"Guangxiang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weifeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Genghui","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingling","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuhao","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maoguo","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107519_b1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","article-title":"A survey of very large-scale neighborhood search techniques","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2026.107519_b2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.asoc.2017.01.039","article-title":"Model-based methods for continuous and discrete global optimization","volume":"55","author":"Bartz-Beielstein","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107519_b3","doi-asserted-by":"crossref","first-page":"1937","DOI":"10.1007\/s10462-020-09896-5","article-title":"A comparative analysis of gradient boosting algorithms","volume":"54","author":"Bent\u00e9jac","year":"2021","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.cor.2026.107519_b4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cor.2026.107519_b5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","article-title":"Exact solution of the quadratic knapsack problem","volume":"11","author":"Caprara","year":"1999","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107519_b6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1162\/EVCO_a_00130","article-title":"Fitness probability distribution of bit-flip mutation","volume":"23","author":"Chicano","year":"2015","journal-title":"Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b7","series-title":"2022 IEEE Congress on Evolutionary Computation","first-page":"1","article-title":"A random forest-assisted decomposition-based evolutionary algorithm for multi-objective combinatorial optimization problems","author":"De Moraes","year":"2022"},{"key":"10.1016\/j.cor.2026.107519_b8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","article-title":"An efficient constraint handling method for genetic algorithms","volume":"186","author":"Deb","year":"2000","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"key":"10.1016\/j.cor.2026.107519_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110061","article-title":"Walsh-based surrogate-assisted multi-objective combinatorial optimization: A fine-grained analysis for pseudo-boolean functions","volume":"136","author":"Derbel","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107519_b10","series-title":"Proceedings of the 26th International Conference on Artificial Intelligence and Statistics","first-page":"7021","article-title":"Bayesian optimization over high-dimensional combinatorial spaces via dictionary-based embeddings","author":"Deshwal","year":"2023"},{"key":"10.1016\/j.cor.2026.107519_b11","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: A gradient boosting machine","volume":"29","author":"Friedman","year":"2001","journal-title":"Ann. Statist."},{"key":"10.1016\/j.cor.2026.107519_b12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","article-title":"Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors)","volume":"28","author":"Friedman","year":"2000","journal-title":"Ann. Statist."},{"key":"10.1016\/j.cor.2026.107519_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107049","article-title":"A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems","volume":"223","author":"Gu","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107519_b14","doi-asserted-by":"crossref","first-page":"2626","DOI":"10.1109\/TEVC.2024.3512795","article-title":"Surrogate-assisted neighborhood search with only a few weight vectors for expensive large-scale multiobjective binary optimization","volume":"29","author":"Gu","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b15","doi-asserted-by":"crossref","first-page":"2699","DOI":"10.1007\/s40747-020-00249-x","article-title":"Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems","volume":"8","author":"Gu","year":"2022","journal-title":"Complex Intell. Syst."},{"key":"10.1016\/j.cor.2026.107519_b16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s12293-021-00326-9","article-title":"A random forest assisted evolutionary algorithm using competitive neighborhood search for expensive constrained combinatorial optimization","volume":"13","author":"Han","year":"2021","journal-title":"Memetic Comput."},{"key":"10.1016\/j.cor.2026.107519_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119495","article-title":"A review of surrogate-assisted evolutionary algorithms for expensive optimization problems","volume":"217","author":"He","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107519_b18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0377-0427(00)00430-1","article-title":"Combinatorial optimization: Current successes and directions for the future","volume":"124","author":"Hoffman","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cor.2026.107519_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108736","article-title":"Multi-surrogate assisted binary particle swarm optimization algorithm and its application for feature selection","volume":"121","author":"Hu","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107519_b20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","article-title":"Surrogate-assisted evolutionary computation: Recent advances and future challenges","volume":"1","author":"Jin","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b21","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TEVC.2018.2869001","article-title":"Data-driven evolutionary optimization: An overview and case studies","volume":"23","author":"Jin","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b22","series-title":"Spin Glasses and Biology","first-page":"61","article-title":"The origins of order: Self-organization and selection in evolution","author":"Kauffman","year":"1992"},{"key":"10.1016\/j.cor.2026.107519_b23","doi-asserted-by":"crossref","unstructured":"Lepr\u00eatre, F., Fonlupt, C., Verel, S., Marion, V., 2020. Combinatorial surrogate-assisted optimization for bus stops spacing problem. In: International Conference on Artificial Evolution (Evolution Artificielle). pp. 42\u201352.","DOI":"10.1007\/978-3-030-45715-0_4"},{"key":"10.1016\/j.cor.2026.107519_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120530","article-title":"Differential evolution with an adaptive penalty coefficient mechanism and a search history exploitation mechanism","volume":"230","author":"Li","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107519_b25","article-title":"Decoupling constraint: Task clone-based multi-tasking optimization for constrained multi-objective optimization","author":"Li","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b26","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1109\/TSMC.2022.3219080","article-title":"Expensive optimization via surrogate-assisted and model-free evolutionary optimization","volume":"53","author":"Li","year":"2023","journal-title":"IEEE Trans. Syst. Man, Cybern.: Syst."},{"key":"10.1016\/j.cor.2026.107519_b27","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/TEVC.2022.3149601","article-title":"A surrogate-assisted evolutionary feature selection algorithm with parallel random grouping for high-dimensional classification","volume":"26","author":"Liu","year":"2022","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107137","article-title":"Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems","volume":"182","author":"Liu","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107519_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.107933","article-title":"A two-stage hybrid ant colony optimization for high-dimensional feature selection","volume":"116","author":"Ma","year":"2021","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.cor.2026.107519_b30","series-title":"Evolutionary Computation in Combinatorial Optimization","first-page":"142","article-title":"Geometric generalisation of surrogate model based optimisation to combinatorial spaces","author":"Moraglio","year":"2011"},{"key":"10.1016\/j.cor.2026.107519_b31","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1016\/j.cor.2012.08.022","article-title":"So-mi: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems","volume":"40","author":"M\u00fcller","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107519_b32","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.1100.0417","article-title":"The knowledge-gradient algorithm for sequencing experiments in drug discovery","volume":"23","author":"Negoescu","year":"2011","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107519_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.105285","article-title":"Mlaco: A multi-label feature selection algorithm based on ant colony optimization","volume":"192","author":"Paniri","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107519_b34","series-title":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","first-page":"542","article-title":"Surrogate-assisted multi-objective combinatorial optimization based on decomposition and walsh basis","author":"Pruvost","year":"2020"},{"key":"10.1016\/j.cor.2026.107519_b35","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.sbspro.2012.09.782","article-title":"A simulation-optimization approach to design efficient systems of bike-sharing","volume":"54","author":"Romero","year":"2012","journal-title":"Procedia - Soc. Behav. Sci."},{"key":"10.1016\/j.cor.2026.107519_b36","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1108\/03684921311295547","article-title":"Boosting: Foundations and algorithms","volume":"42","author":"Schapire","year":"2013","journal-title":"Kybernetes"},{"key":"10.1016\/j.cor.2026.107519_b37","series-title":"2018 IEEE 8th International Advance Computing Conference","first-page":"338","article-title":"Review of bagging and boosting classification performance on unbalanced binary classification","author":"Singhal","year":"2018"},{"key":"10.1016\/j.cor.2026.107519_b38","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TEVC.2019.2924461","article-title":"Surrogate-assisted evolutionary deep learning using an end-to-end random forest-based performance predictor","volume":"24","author":"Sun","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b39","series-title":"ICGA","article-title":"Uniform crossover in genetic algorithms","author":"Syswerda","year":"1989"},{"key":"10.1016\/j.cor.2026.107519_b40","series-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","first-page":"181","article-title":"A surrogate model based on walsh decomposition for pseudo-boolean functions","author":"Verel","year":"2018"},{"key":"10.1016\/j.cor.2026.107519_b41","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1109\/TCYB.2018.2869674","article-title":"A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems","volume":"50","author":"Wang","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.cor.2026.107519_b42","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/TEVC.2016.2555315","article-title":"Data-driven surrogate-assisted multiobjective evolutionary optimization of a trauma system","volume":"20","author":"Wang","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b43","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TEVC.2018.2872453","article-title":"A generator for multiobjective test problems with difficult-to-approximate pareto front boundaries","volume":"23","author":"Wang","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107519_b44","doi-asserted-by":"crossref","first-page":"7769","DOI":"10.1109\/TSMC.2023.3299434","article-title":"An efficient two-stage surrogate-assisted differential evolution for expensive inequality constrained optimization","volume":"53","author":"Wei","year":"2023","journal-title":"IEEE Trans. Syst. Man, Cybern.: Syst."},{"key":"10.1016\/j.cor.2026.107519_b45","doi-asserted-by":"crossref","first-page":"5071","DOI":"10.1109\/TSMC.2023.3259947","article-title":"A hybrid regressor and classifier-assisted evolutionary algorithm for expensive optimization with incomplete constraint information","volume":"53","author":"Wei","year":"2023","journal-title":"IEEE Trans. Syst. Man, Cybern.: Syst."},{"key":"10.1016\/j.cor.2026.107519_b46","series-title":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","first-page":"871","article-title":"Efficient global optimization for combinatorial problems","author":"Zaefferer","year":"2014"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:33:09Z","timestamp":1782491589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":46,"alternative-id":["S0305054826001371"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107519","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Surrogate-assisted evolutionary algorithm with least squares boosting and random multi-neighborhood search for expensive binary optimization","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107519","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107519"}}