{"id":"https://openalex.org/W4226320851","doi":"https://doi.org/10.1007/s44196-022-00096-3","title":"Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem","display_name":"Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem","publication_year":2022,"publication_date":"2022-07-04","ids":{"openalex":"https://openalex.org/W4226320851","doi":"https://doi.org/10.1007/s44196-022-00096-3"},"language":"en","primary_location":{"id":"doi:10.1007/s44196-022-00096-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44196-022-00096-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44196-022-00096-3.pdf","source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s44196-022-00096-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100550500","display_name":"Jianrong Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianrong Zhou","raw_affiliation_strings":["School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103094509","display_name":"Jiongzhi Zheng","orcid":"https://orcid.org/0000-0002-1013-2651"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiongzhi Zheng","raw_affiliation_strings":["School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033526822","display_name":"Kun He","orcid":"https://orcid.org/0000-0001-7627-4604"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kun He","raw_affiliation_strings":["School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, Hubei, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100550500"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":{"value":1390,"currency":"GBP","value_usd":1704},"apc_paid":{"value":1390,"currency":"GBP","value_usd":1704},"fwci":0.4059,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66179365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8994157314300537},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6546032428741455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6369361877441406},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6052001118659973},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5747663378715515},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5710259675979614},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5509318113327026},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.539280116558075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5210299491882324},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4907854497432709},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.4774356782436371},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.47353002429008484},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4702913761138916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4168805778026581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40590745210647583},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.2184465527534485}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8994157314300537},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6546032428741455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6369361877441406},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6052001118659973},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5747663378715515},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5710259675979614},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5509318113327026},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.539280116558075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5210299491882324},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4907854497432709},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4774356782436371},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47353002429008484},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4702913761138916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4168805778026581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40590745210647583},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2184465527534485},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s44196-022-00096-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44196-022-00096-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44196-022-00096-3.pdf","source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:2f0a6270952540adb769b37fa3fc9224","is_oa":true,"landing_page_url":"https://doaj.org/article/2f0a6270952540adb769b37fa3fc9224","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Intelligence Systems, Vol 15, Iss 1, Pp 1-20 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s44196-022-00096-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44196-022-00096-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44196-022-00096-3.pdf","source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226320851.pdf","grobid_xml":"https://content.openalex.org/works/W4226320851.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W71047039","https://openalex.org/W1482405521","https://openalex.org/W1680189815","https://openalex.org/W1983860569","https://openalex.org/W1990313671","https://openalex.org/W2021083959","https://openalex.org/W2065487600","https://openalex.org/W2080379754","https://openalex.org/W2093221924","https://openalex.org/W2110443819","https://openalex.org/W2171471009","https://openalex.org/W2527211725","https://openalex.org/W2625926059","https://openalex.org/W2943360099","https://openalex.org/W2952148755","https://openalex.org/W2964468721","https://openalex.org/W2978317471","https://openalex.org/W3046503831","https://openalex.org/W3118296807","https://openalex.org/W3135383876","https://openalex.org/W3171878699","https://openalex.org/W4221016829","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2891162720","https://openalex.org/W2169800510","https://openalex.org/W3171554204","https://openalex.org/W3199776955","https://openalex.org/W2167807475","https://openalex.org/W3112089036"],"abstract_inverted_index":{"Abstract":[0],"We":[1,142],"address":[2],"the":[3,18,24,53,62,65,86,101,112,117,131,150,172,178,190,215,218,238,242],"Budgeted":[4],"Maximum":[5],"Coverage":[6],"Problem":[7],"(BMCP),":[8],"which":[9],"is":[10,71],"a":[11,42,78,95,104,145,158],"natural":[12],"and":[13,23,41,64,135,137,198,210,227,241],"more":[14],"practical":[15],"extension":[16],"of":[17,36,56,68,122,217],"standard":[19],"0\u20131":[20],"knapsack":[21],"problem":[22],"set":[25],"cover":[26],"problem.":[27],"Given":[28],"m":[29],"elements":[30,37,70,186],"with":[31,38,206],"nonnegative":[32,39],"weights,":[33],"n":[34],"subsets":[35,50,58,156,180],"costs,":[40],"total":[43,54,66],"budget,":[44,63],"BMCP":[45,192,219],"aims":[46],"to":[47,129,138,148,213],"select":[48],"some":[49],"such":[51],"that":[52,109,153,234],"cost":[55],"selected":[57,179],"does":[59],"not":[60],"exceed":[61],"weight":[67],"associated":[69,168],"maximized.":[72],"In":[73],"this":[74],"paper,":[75],"we":[76,201,231],"propose":[77,144],"variable":[79],"depth":[80],"local":[81],"search":[82,107],"algorithm":[83,151],"(VDLS)":[84],"for":[85],"BMCP.":[87],"VDLS":[88,128,175,235],"first":[89],"generates":[90],"an":[91],"initial":[92],"solution":[93,102,113,132],"by":[94,114],"greedy":[96],"algorithm,":[97],"then":[98],"iteratively":[99],"improves":[100],"through":[103],"partial":[105],"depth-first":[106],"method,":[108],"can":[110,176],"improve":[111],"simultaneously":[115],"changing":[116],"states":[118],"(selected":[119],"or":[120],"not)":[121],"multiple":[123],"subsets.":[124],"Such":[125],"method":[126],"allows":[127],"explore":[130],"space":[133],"widely":[134],"deeply,":[136],"yield":[139],"high-quality":[140],"solutions.":[141],"further":[143],"neighbor":[146,159,173],"structure":[147],"boost":[149],"performance,":[152],"is,":[154],"both":[155],"have":[157,195],"relation":[160],"if":[161],"they":[162],"share":[163],"at":[164],"least":[165],"one":[166],"common":[167],"element.":[169],"By":[170],"applying":[171],"structure,":[174],"adjust":[177],"while":[181],"losing":[182],"as":[183,187],"few":[184],"covered":[185],"possible.":[188],"Since":[189],"existing":[191,239],"benchmarks":[193],"only":[194],"simple":[196],"structures":[197,212],"small":[199],"scales,":[200],"design":[202],"60":[203,228],"new":[204,229],"instances":[205,226,230],"relatively":[207],"large":[208],"scales":[209],"complex":[211],"enrich":[214],"diversity":[216],"instances.":[220],"Experimental":[221],"results":[222],"on":[223],"30":[224],"public":[225],"designed":[232],"demonstrate":[233],"significantly":[236],"outperforms":[237],"heuristic":[240],"general":[243],"CPLEX":[244],"exact":[245],"solver.":[246]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}