{"id":"https://openalex.org/W2537710285","doi":"https://doi.org/10.1109/fskd.2016.7603164","title":"Relationship between success ratios of hybrid algorithms and those of basic algorithms on bimodal MaxSAT problems","display_name":"Relationship between success ratios of hybrid algorithms and those of basic algorithms on bimodal MaxSAT problems","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2537710285","doi":"https://doi.org/10.1109/fskd.2016.7603164","mag":"2537710285"},"language":"en","primary_location":{"id":"doi:10.1109/fskd.2016.7603164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051966754","display_name":"Xinsheng Lai","orcid":"https://orcid.org/0000-0002-2849-4298"},"institutions":[{"id":"https://openalex.org/I10496686","display_name":"Shangrao Normal University","ror":"https://ror.org/024qkwh22","country_code":"CN","type":"education","lineage":["https://openalex.org/I10496686"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinsheng Lai","raw_affiliation_strings":["School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China","institution_ids":["https://openalex.org/I10496686"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043407575","display_name":"Hong Hu","orcid":"https://orcid.org/0000-0001-9695-2484"},"institutions":[{"id":"https://openalex.org/I10496686","display_name":"Shangrao Normal University","ror":"https://ror.org/024qkwh22","country_code":"CN","type":"education","lineage":["https://openalex.org/I10496686"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Hu","raw_affiliation_strings":["School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China","institution_ids":["https://openalex.org/I10496686"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109163554","display_name":"Qing Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I10496686","display_name":"Shangrao Normal University","ror":"https://ror.org/024qkwh22","country_code":"CN","type":"education","lineage":["https://openalex.org/I10496686"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qing Yan","raw_affiliation_strings":["School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China","institution_ids":["https://openalex.org/I10496686"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101194480","display_name":"Yulin Zhou","orcid":"https://orcid.org/0000-0002-1466-1112"},"institutions":[{"id":"https://openalex.org/I10496686","display_name":"Shangrao Normal University","ror":"https://ror.org/024qkwh22","country_code":"CN","type":"education","lineage":["https://openalex.org/I10496686"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yulin Zhou","raw_affiliation_strings":["School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, ShangRao Normal University, Shangrao, China","institution_ids":["https://openalex.org/I10496686"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I10496686"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"220","issue":null,"first_page":"139","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9743000268936157,"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/algorithm","display_name":"Algorithm","score":0.8749045133590698},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.7209653258323669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5670211315155029},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4913412630558014},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4832533001899719},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4722282886505127},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18814635276794434},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.07349133491516113}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.8749045133590698},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.7209653258323669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5670211315155029},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4913412630558014},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4832533001899719},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4722282886505127},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18814635276794434},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.07349133491516113},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fskd.2016.7603164","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322665","display_name":"Natural Science Foundation of Jiangxi Province","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W179290619","https://openalex.org/W1820801893","https://openalex.org/W1980158661","https://openalex.org/W1985153141","https://openalex.org/W1998291836","https://openalex.org/W2005679383","https://openalex.org/W2011039300","https://openalex.org/W2023923770","https://openalex.org/W2024060531","https://openalex.org/W2026355757","https://openalex.org/W2060265333","https://openalex.org/W2068804307","https://openalex.org/W2091342063","https://openalex.org/W2096037858","https://openalex.org/W2109398796","https://openalex.org/W2118573797","https://openalex.org/W2165207629","https://openalex.org/W2185238772","https://openalex.org/W2314161936","https://openalex.org/W2327095213","https://openalex.org/W3101609231","https://openalex.org/W6607217452","https://openalex.org/W6674678059"],"related_works":["https://openalex.org/W2352224959","https://openalex.org/W2088274154","https://openalex.org/W4382862956","https://openalex.org/W2359271842","https://openalex.org/W2387988578","https://openalex.org/W2376347219","https://openalex.org/W2147164533","https://openalex.org/W2104097264","https://openalex.org/W2537710285","https://openalex.org/W2140656843"],"abstract_inverted_index":{"Empirical":[0],"results":[1],"showed":[2],"that":[3,101,118],"it":[4],"is":[5,19,43,145],"a":[6,30,73,78,105,110],"promising":[7],"way":[8],"to":[9,21,91,132],"design":[10],"more":[11],"powerful":[12],"algorithms":[13,37,59,64,71,125],"by":[14,147],"combining":[15],"different":[16,85],"algorithms.":[17],"It":[18],"interesting":[20],"investigate":[22],"the":[23,26,40,50,53,92,127,135,140],"relationship":[24,51],"between":[25,52],"success":[27,54,88,128],"ratio":[28,89,129],"of":[29,35,56,62,94,134],"hybrid":[31,41,58,70,124],"algorithm":[32,42,76,82,103,138],"and":[33,60,139],"those":[34,61,133],"basic":[36,63],"on":[38,65,119],"which":[39,144],"based.":[44],"In":[45],"this":[46],"paper,":[47],"we":[48],"analyze":[49],"ratios":[55],"two":[57],"bimodal":[66,120],"MaxSAT":[67,121],"problems.":[68],"Both":[69],"combine":[72],"hill-climbing":[74,136],"RandomWalk":[75,137],"with":[77,130],"local":[79,141],"(1+1)":[80,142],"evolutionary":[81],"(EA)":[83],"in":[84],"ways.":[86],"The":[87],"refers":[90],"percentage":[93],"successful":[95,98],"runs.":[96],"A":[97],"run":[99],"means":[100],"an":[102],"finds":[104],"globally":[106],"optimal":[107],"solution":[108],"when":[109],"termination":[111],"condition":[112],"has":[113],"been":[114],"reached.":[115],"Analysis":[116],"shows":[117],"problems":[122],"neither":[123],"improves":[126],"respect":[131],"EA,":[143],"tested":[146],"experiments.":[148]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}