{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006959686,0.0009167988,0.001028158,0.0009784475,0.0006147071,0.0007978057,0.00113707,0.001128384,0.002537111],"category_scores_gemma":[0.001948927,0.0004585268,0.0006356751,0.001137788,0.0004239746,0.0007004137,0.001118302,0.000758913,0.0003731724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008872383,"about_ca_system_score_gemma":0.002021773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008608248,"about_ca_topic_score_gemma":0.007607827,"domain_scores_codex":[0.9996343,0.0001060916,0.00002147589,0.00008319708,0.00008536309,0.00006964888],"domain_scores_gemma":[0.9993943,0.0003134327,0.00007955306,0.00003364616,0.0001501177,0.00002896506],"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.00002190092,0.00001498056,0.0003267775,0.00004567626,0.00001378823,0.00004569286,0.00004425668,0.9697482,0.0007232137,0.005214239,0.0005870057,0.02321419],"study_design_scores_gemma":[0.000008385287,0.000009887599,0.00004602699,0.00000273309,0.000002976424,0.00001081973,0.00001476021,0.9974093,0.0001462898,0.002069775,0.0002768534,0.000002184723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550823,0.0001468481,0.9815844,0.00009236541,0.00001729255,0.00006877822,0.00006659197,0.0001734829,0.002342006],"genre_scores_gemma":[0.3909626,0.0002527836,0.6051753,0.00005238958,0.00002770033,0.0003958832,0.0002626473,0.00007053751,0.002800184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008608248,"threshold_uncertainty_score":0.01711631,"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."}}