{"id":"W1982600687","doi":"10.1016/j.cor.2004.11.021","title":"Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Sequence (biology); Computer science; Computation; Travel time; Mathematical optimization; Route planning; Decomposition; Plan (archaeology); Shortest path problem; Mathematics; Algorithm; Theoretical computer science; Graph; Transport engineering","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.001988401,0.001098664,0.001507784,0.00176062,0.001451074,0.001254185,0.002732388,0.002938438,0.003452662],"category_scores_gemma":[0.01062353,0.001104418,0.001251527,0.003848581,0.001329998,0.00201064,0.001295766,0.00182941,0.0001742219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002572235,"about_ca_system_score_gemma":0.0025523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05229365,"about_ca_topic_score_gemma":0.03020299,"domain_scores_codex":[0.9995153,0.0002102352,0.00002296008,0.0001080473,0.00008520069,0.00005827568],"domain_scores_gemma":[0.9914698,0.007292193,0.000316547,0.0001436277,0.0003893643,0.0003885079],"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.00008195656,0.00008140497,0.0003238151,0.00006605339,0.00002186254,0.00008449124,0.00005788238,0.9888359,0.0002431428,0.004594848,0.0004889863,0.005119631],"study_design_scores_gemma":[0.00002445044,0.00002417674,0.00009070305,0.000002231585,0.000009497193,0.000008492956,0.000019413,0.9972857,0.00008084756,0.002337327,0.0001120096,0.000005090671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.531535,0.001014689,0.4575513,0.001421759,0.0001585391,0.0002459485,0.0009795928,0.0004812945,0.006611867],"genre_scores_gemma":[0.7905416,0.0006878172,0.2027275,0.00005776393,0.0000720338,0.0001956318,0.0007110261,0.0001197643,0.004886914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05229365,"threshold_uncertainty_score":0.1039786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08730844122553108,"score_gpt":0.3832802464060155,"score_spread":0.2959718051804844,"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."}}