{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750913,0.0001251364,0.0001293763,0.00008845861,0.0005085746,0.0001954318,0.0001216072,0.0001187913,0.0002380448],"category_scores_gemma":[0.00005210311,0.0001300681,0.00006002594,0.0002605832,0.00006889451,0.0004204998,0.000005083765,0.00004701237,0.00001708229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000560503,"about_ca_system_score_gemma":0.00007694175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000622718,"about_ca_topic_score_gemma":0.0002021682,"domain_scores_codex":[0.9988123,0.00006566128,0.0002882988,0.0002714202,0.0002877288,0.0002745917],"domain_scores_gemma":[0.9994003,0.00005485574,0.0001286208,0.000110864,0.0002385134,0.00006681911],"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.00001334091,0.00003930904,0.001188085,0.000007549077,0.000006841592,7.350832e-7,0.001147863,0.9932056,0.00008134489,0.002577159,0.001279688,0.0004524685],"study_design_scores_gemma":[0.0009106224,0.00009024787,0.001258847,0.00005973823,0.00007215713,7.941072e-7,0.0005919997,0.9790028,0.0001239759,0.00092676,0.01649948,0.0004625884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001005293,0.00006947979,0.9847389,0.0005828374,0.0002750726,0.0007669163,0.0001392131,0.0003052025,0.01211713],"genre_scores_gemma":[0.6741499,0.0001679375,0.2933035,0.0001967869,0.001073703,0.0003856691,0.009865349,0.0001121936,0.02074496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6914354,"threshold_uncertainty_score":0.5304025,"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."}}