{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003061664,0.0001198644,0.0003068639,0.001054532,0.0003258165,0.000736854,0.0008231673,0.00003125849,0.00006363435],"category_scores_gemma":[0.0006681386,0.00006872167,0.0002851204,0.001947215,0.0001049707,0.000230627,0.00009362696,0.0001453024,0.00001009852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007094124,"about_ca_system_score_gemma":0.00008584803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002961866,"about_ca_topic_score_gemma":0.0001777414,"domain_scores_codex":[0.9973968,0.00009772243,0.0007892778,0.0003014456,0.001272468,0.0001423188],"domain_scores_gemma":[0.9927361,0.004660969,0.0006928819,0.0002549477,0.001565437,0.00008963572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005129121,0.0006239028,0.02057701,0.000004830777,0.006898072,0.00002111807,0.002073872,0.1431867,0.04212281,0.2244319,0.001939342,0.5576075],"study_design_scores_gemma":[0.003559626,0.0002531876,0.2858143,0.0001128683,0.002232001,0.0005778303,0.01154737,0.4043694,0.0005641936,0.2664421,0.02394347,0.0005836074],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02435736,0.00003522349,0.9718861,0.003031428,0.00008827785,0.00019024,0.0001246366,0.00001079649,0.0002759547],"genre_scores_gemma":[0.9446306,0.00002467612,0.05454008,0.0002437904,0.0002905194,0.00007022247,0.00001783216,0.000009572893,0.0001727694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9202732,"threshold_uncertainty_score":0.7105501,"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."}}