{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000734618,0.0006084841,0.0009330142,0.001101901,0.0005589392,0.0007440648,0.0008936329,0.001429029,0.003969167],"category_scores_gemma":[0.00412737,0.000450944,0.0007769565,0.001248694,0.0006657512,0.001249217,0.0008330933,0.0008649931,0.0004893339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005007908,"about_ca_system_score_gemma":0.0007653357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176901,"about_ca_topic_score_gemma":0.001800628,"domain_scores_codex":[0.9996994,0.0001033946,0.00001655062,0.00003879318,0.0001040499,0.00003791435],"domain_scores_gemma":[0.9994162,0.0003969504,0.00004275193,0.00004543512,0.00008077294,0.00001786483],"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.0001626588,0.0001225789,0.0008701392,0.0001597009,0.0000763192,0.0001216572,0.0001010734,0.8730178,0.0020436,0.02690971,0.001906082,0.09450876],"study_design_scores_gemma":[0.00002604732,0.0000394747,0.00008877751,0.00001191994,0.000009977987,0.00003618597,0.0000245031,0.9899099,0.0003506483,0.00873429,0.0007651327,0.00000321607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0748899,0.0007605831,0.9120309,0.0003330116,0.0001235749,0.0001105086,0.00007556495,0.0003458208,0.01133012],"genre_scores_gemma":[0.3412208,0.0005563565,0.6529387,0.000128285,0.00005566104,0.0003047852,0.0002443503,0.0001047229,0.004446452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003969167,"threshold_uncertainty_score":0.01327819,"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."}}