{"id":"W2020257725","doi":"10.1016/j.disopt.2006.05.006","title":"Algorithms for time-dependent bicriteria shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Constrained Shortest Path First; Path (computing); Mathematical optimization; Algorithm; Computer science; Euclidean shortest path; Shortest Path Faster Algorithm; Travel time; Mathematics; Dijkstra's algorithm; Theoretical computer science; Graph","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.002287934,0.001598472,0.002323388,0.001857404,0.001273493,0.002355776,0.003849979,0.002146458,0.007338675],"category_scores_gemma":[0.01016346,0.00124801,0.001321865,0.003627027,0.001163352,0.003192099,0.003231309,0.003100513,0.001589687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944653,"about_ca_system_score_gemma":0.002587048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008852746,"about_ca_topic_score_gemma":0.01057325,"domain_scores_codex":[0.998542,0.0004677873,0.00009079868,0.0003111286,0.0003745882,0.0002137498],"domain_scores_gemma":[0.995759,0.002651596,0.0003317322,0.0004260009,0.0006241187,0.0002075217],"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.0002427021,0.0001469747,0.0005149404,0.0002901817,0.00008121823,0.00004208904,0.0001848419,0.7834795,0.0006035618,0.07090334,0.007257659,0.136253],"study_design_scores_gemma":[0.00007010893,0.00003035426,0.00008758302,0.00003053578,0.00001602334,0.00002876836,0.00004389364,0.9473733,0.0002931436,0.04907202,0.002941468,0.00001284029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006082437,0.0006307627,0.988264,0.0002676526,0.00009828443,0.000084303,0.0001158501,0.000333154,0.004123718],"genre_scores_gemma":[0.151686,0.000947319,0.8385698,0.0001926354,0.0001109884,0.0005179486,0.0007499622,0.0003250765,0.00690039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008852746,"threshold_uncertainty_score":0.02455032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0143382204143877,"score_gpt":0.2744137807614725,"score_spread":0.2600755603470848,"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."}}