{"id":"https://openalex.org/W2344083109","doi":"https://doi.org/10.5220/0005810004720479","title":"Bees Swarm Optimization Metaheuristic Guided by Decomposition for Solving MAX-SAT","display_name":"Bees Swarm Optimization Metaheuristic Guided by Decomposition for Solving MAX-SAT","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2344083109","doi":"https://doi.org/10.5220/0005810004720479","mag":"2344083109"},"language":"en","primary_location":{"id":"doi:10.5220/0005810004720479","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005810004720479","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005810004720479","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057697626","display_name":"Youcef Djenouri","orcid":"https://orcid.org/0000-0003-0135-7450"},"institutions":[{"id":"https://openalex.org/I83332908","display_name":"University of Blida","ror":"https://ror.org/03g41pw14","country_code":"DZ","type":"education","lineage":["https://openalex.org/I83332908"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Youcef Djenouri","raw_affiliation_strings":["Saad Dahleb University, Algeria"],"affiliations":[{"raw_affiliation_string":"Saad Dahleb University, Algeria","institution_ids":["https://openalex.org/I83332908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110043391","display_name":"Zineb Habbas","orcid":null},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zineb Habbas","raw_affiliation_strings":["University of Lorraine, France"],"affiliations":[{"raw_affiliation_string":"University of Lorraine, France","institution_ids":["https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051506411","display_name":"Wassila Aggoune\u2010Mtalaa","orcid":"https://orcid.org/0000-0001-8592-2167"},"institutions":[{"id":"https://openalex.org/I4210112527","display_name":"Luxembourg Institute of Science and Technology","ror":"https://ror.org/01t178j62","country_code":"LU","type":"education","lineage":["https://openalex.org/I4210112527"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Wassila Aggoune-Mtalaa","raw_affiliation_strings":["LIST and Luxembourg Institute of Science and Technology G.D., Luxembourg"],"affiliations":[{"raw_affiliation_string":"LIST and Luxembourg Institute of Science and Technology G.D., Luxembourg","institution_ids":["https://openalex.org/I4210112527"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057697626"],"corresponding_institution_ids":["https://openalex.org/I83332908"],"apc_list":null,"apc_paid":null,"fwci":1.6714,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85465203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"472","last_page":"479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9889000058174133,"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.9889000058174133,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9592999815940857,"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.9545000195503235,"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/metaheuristic","display_name":"Metaheuristic","score":0.8576475381851196},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.7218779921531677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6214736104011536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5880004167556763},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49921369552612305},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.477007657289505},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4719630479812622},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4320460855960846},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4232184588909149},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4104830026626587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32383519411087036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.314169704914093},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12743040919303894},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.12634214758872986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.05779367685317993}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8576475381851196},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7218779921531677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6214736104011536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5880004167556763},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49921369552612305},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.477007657289505},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4719630479812622},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4320460855960846},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4232184588909149},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4104830026626587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32383519411087036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.314169704914093},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12743040919303894},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.12634214758872986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.05779367685317993},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005810004720479","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005810004720479","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005810004720479","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005810004720479","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3205136130","https://openalex.org/W89357012","https://openalex.org/W2046609661","https://openalex.org/W1575663621","https://openalex.org/W2286894734","https://openalex.org/W2079274775","https://openalex.org/W1604727913","https://openalex.org/W1975009952","https://openalex.org/W3012852983","https://openalex.org/W1963661129"],"abstract_inverted_index":{"Decomposition":[0],"methods":[1,21,187],"aim":[2],"to":[3,27,55,121,166],"split":[4],"a":[5,8,10,88,105,135],"problem":[6,98,180],"into":[7],"collection":[9,11],"of":[12,38,44,125,128,138],"smaller":[13],"interconnected":[14],"sub-problems.\r\n\r\nSeveral":[15],"research":[16],"works":[17],"have":[18],"explored":[19],"decomposition":[20,32,51,89,106],"for":[22,79],"solving":[23],"large":[24],"optimization":[25,46],"problems.\r\n\r\nDue":[26],"its":[28],"theroretical":[29],"properties,":[30],"Tree":[31,50],"has":[33,52],"been":[34],"especially":[35],"the":[36,42,57,81,96,101,126,129,149,172,175,178],"subject":[37],"numerous\r\n\r\nsuccessfull":[39],"studies":[40],"in":[41,123],"context":[43],"exact":[45],"solvers.":[47],"More":[48,91],"recently,":[49],"been\r\n\r\nsuccessfully":[53],"used":[54,184],"guide":[56],"Variable":[58],"Neighbor":[59],"Search":[60],"(VNS)":[61],"local":[62],"search":[63],"method.":[64,90,107],"Our":[65],"present":[66],"contribution\r\n\r\nfollows":[67],"this":[68,93,160],"last":[69],"direction":[70],"and":[71,77,99,114,181],"proposes":[72],"two":[73],"approaches":[74],"called":[75],"BSOGD1":[76],"BSOGD2":[78],"guiding":[80],"Bees\r\n\r\nSwarm":[82],"Optimization":[83],"(BSO)":[84],"metaheuristic":[85],"by":[86],"using":[87],"pragmatically,":[92],"paper\r\n\r\ndeals":[94],"with":[95,145,185],"MAX-SAT":[97],"uses":[100],"Kmeans":[102],"algorithm":[103],"as":[104,171,188,190],"Several":[108],"experimental\r\n\r\nresults":[109],"conducted":[110],"on":[111],"DIMACS":[112],"benchmarks":[113],"some":[115],"other":[116,168,191],"hard":[117,146],"SAT":[118],"instances":[119,147],"lead":[120],"promising\r\n\r\nresults":[122],"terms":[124],"quality":[127],"solutions.":[130],"Moreover,":[131],"these":[132,154],"experiments":[133],"highlight":[134],"good":[136],"stability":[137],"the\r\n\r\ntwo":[139],"approaches,":[140],"more":[141],"especially,":[142],"when":[143],"dealing":[144],"like":[148],"Parity8":[150],"family":[151],"from":[152],"DIMACS.\r\n\r\nBeyond":[153],"first":[155],"promising":[156],"results,":[157],"note":[158],"that":[159],"approach":[161],"can":[162,182],"be":[163,183],"easily":[164],"applied":[165],"many":[167],"optimization\r\n\r\nproblems":[169],"such":[170],"Weighted":[173],"MAX-SAT,":[174],"MAX-CSP":[176],"or":[177],"coloring":[179],"other\r\n\r\ndecomposition":[186],"well":[189],"metaheuristics.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}