{"id":"W2518921919","doi":"10.1002/atr.1408","title":"Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks","year":2016,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Hong Kong Polytechnic University; National Natural Science Foundation of China","keywords":"Shortest path problem; Computer science; Reliability (semiconductor); K shortest path routing; Mathematical optimization; Constraint (computer-aided design); Flow network; Travel time; Dominance (genetics); Constrained Shortest Path First; Path (computing); Dijkstra's algorithm; Yen's algorithm; Private Network-to-Network Interface; Algorithm; Routing (electronic design automation); Transport engineering; Mathematics; Engineering; Routing protocol; Link-state routing protocol; Graph; Computer network; Theoretical computer science","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.0006989864,0.00009955514,0.0001843231,0.0001720285,0.000181267,0.00002078699,0.0001001487,0.000102711,0.00001738258],"category_scores_gemma":[0.00006211622,0.00008227812,0.00008999742,0.0002413222,0.00003951841,0.0003393806,5.065824e-7,0.0001003792,7.467165e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001682044,"about_ca_system_score_gemma":0.0001616132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001070682,"about_ca_topic_score_gemma":0.001796294,"domain_scores_codex":[0.9985403,0.00004129696,0.0006295626,0.000149612,0.0003826515,0.0002565092],"domain_scores_gemma":[0.998915,0.0001266268,0.0004779076,0.00005525496,0.0003360312,0.00008914509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001169574,0.00006790894,0.005996826,0.000004413325,0.000008914666,0.00001067565,0.003314135,0.8978609,0.0005382043,0.0003216134,0.00001501472,0.09174446],"study_design_scores_gemma":[0.01033158,0.0008034604,0.8597918,0.001591889,0.0002078865,0.000005387501,0.005372567,0.1163155,0.0007685676,0.001226949,0.002817539,0.0007669444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2287364,0.0001188837,0.769832,0.0003014571,0.0006701355,0.0002543929,0.00001998514,0.00002125507,0.00004547636],"genre_scores_gemma":[0.9519182,0.0002876484,0.04744462,0.00002179053,0.0001840898,0.00001306606,0.0000346229,0.00001317543,0.00008272717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8537949,"threshold_uncertainty_score":0.3355204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01208523533197398,"score_gpt":0.2742313739504415,"score_spread":0.2621461386184675,"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."}}