{"id":"W4388861964","doi":"10.28924/2291-8639-21-2023-121","title":"A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Vagueness; Mathematical optimization; Constrained Shortest Path First; Computer science; Longest path problem; Node (physics); K shortest path routing; Fuzzy number; Path (computing); Fuzzy logic; Scheduling (production processes); Mathematics; Fuzzy set; Theoretical computer science; Artificial intelligence; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452267,0.001070914,0.001249535,0.001442417,0.0007016437,0.001189426,0.001401687,0.001235423,0.002252757],"category_scores_gemma":[0.002616993,0.0004480136,0.001518732,0.00133483,0.0007053482,0.001645827,0.0009318002,0.00150567,0.000346511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001218324,"about_ca_system_score_gemma":0.00225959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003247126,"about_ca_topic_score_gemma":0.002876932,"domain_scores_codex":[0.9992423,0.0001804737,0.00005233096,0.0001521835,0.0003208678,0.0000518313],"domain_scores_gemma":[0.9991454,0.0004637262,0.00007562729,0.0000462073,0.0002375538,0.0000314997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001173458,0.00009109508,0.0005540131,0.0006592522,0.00010647,0.0002156882,0.0003638892,0.6447984,0.01220967,0.1053807,0.004314589,0.231189],"study_design_scores_gemma":[0.00001944108,0.00007076601,0.0001103226,0.00002991576,0.00002509772,0.0001300181,0.00003255273,0.9834321,0.001501973,0.0113632,0.003260001,0.00002460304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001598669,0.000141023,0.9971287,0.00005901062,0.00003931835,0.00003342345,0.00001499821,0.00004497025,0.000939993],"genre_scores_gemma":[0.1037083,0.0005063548,0.8931518,0.0000665927,0.0000641368,0.000218998,0.00006837681,0.00005792173,0.002157443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003247126,"threshold_uncertainty_score":0.008839548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1237898522401636,"score_gpt":0.479491927614491,"score_spread":0.3557020753743274,"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."}}