{"id":"W2550177187","doi":"10.1080/18756891.2016.1256577","title":"A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Hebei GEO University; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Harmony search; Cuckoo search; Knapsack problem; Computer science; Continuous knapsack problem; Algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006422878,0.001170862,0.001211912,0.001136931,0.0007051394,0.0008642428,0.002073238,0.001378874,0.002805974],"category_scores_gemma":[0.001127275,0.0005300523,0.0007703457,0.001354599,0.0005850019,0.0009185392,0.001177085,0.0006653665,0.0005820636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005966375,"about_ca_system_score_gemma":0.001354511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008007319,"about_ca_topic_score_gemma":0.005953515,"domain_scores_codex":[0.9994306,0.0001380165,0.00002998317,0.00007879965,0.0002608855,0.00006166867],"domain_scores_gemma":[0.9997169,0.00009395008,0.00003362764,0.00002122929,0.0001074759,0.0000267946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001553403,0.00008979352,0.0007888669,0.0002351441,0.0001280087,0.0001547863,0.0001426259,0.8310075,0.007408295,0.01649266,0.003996268,0.1394007],"study_design_scores_gemma":[0.00004751867,0.00005825953,0.0001212134,0.00001118287,0.00001325992,0.00005210177,0.00001351815,0.9939471,0.0008229775,0.001866478,0.003029905,0.00001637044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02493026,0.001115725,0.959743,0.0001714942,0.0001598473,0.0002070239,0.00006121885,0.0007503185,0.01286106],"genre_scores_gemma":[0.4938356,0.0007529234,0.4918209,0.0003449864,0.0001263877,0.0007870713,0.0002962537,0.0002218275,0.011814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008007319,"threshold_uncertainty_score":0.01592141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05379947559308494,"score_gpt":0.3403491801626603,"score_spread":0.2865497045695753,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}