{"id":"W2399372960","doi":"10.1007/s11227-016-1739-2","title":"Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Travelling salesman problem; Computer science; Metaheuristic; Mathematical optimization; Firefly algorithm; Search algorithm; Beam search; Algorithm; Combinatorial optimization; Guided Local Search; Local search (optimization); Best-first search; Optimization problem; Benchmark (surveying); Mathematics; Particle swarm optimization","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004889206,0.000136245,0.0002854909,0.0003584544,0.0003601066,0.0001197382,0.0008060564,0.00005147639,0.00002133733],"category_scores_gemma":[0.0003095896,0.00007913387,0.00006685445,0.0006109239,0.0001658827,0.0007214014,0.0005426958,0.0002341267,0.000001606845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008625007,"about_ca_system_score_gemma":0.0001833851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002292021,"about_ca_topic_score_gemma":2.68282e-7,"domain_scores_codex":[0.9974689,0.0004874206,0.0007218345,0.000179012,0.0007253661,0.0004174202],"domain_scores_gemma":[0.9978116,0.0007315922,0.0003274412,0.0002961444,0.0007016502,0.0001316378],"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.00001333047,0.0001192082,0.0005073774,0.00008915023,0.0001071708,0.00001359583,0.003272945,0.8408728,0.03252698,0.001144612,0.00006621051,0.1212666],"study_design_scores_gemma":[0.0005283261,0.00009407658,0.0001011969,0.0001917427,0.00002057265,0.0004859327,0.0001273749,0.9959474,0.002087598,0.000306293,0.000009741715,0.00009976368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02665401,0.0003247024,0.9719294,0.0007049124,0.0001650254,0.0001715348,0.000003326062,0.00001989053,0.00002725916],"genre_scores_gemma":[0.2017383,0.0002228285,0.7978581,0.00001910327,0.0001205522,5.108622e-7,2.933712e-7,0.00001503266,0.00002522134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1750843,"threshold_uncertainty_score":0.3226985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08004275425044745,"score_gpt":0.2965008824944893,"score_spread":0.2164581282440419,"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."}}