{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009826,0.0001409,0.0001793672,0.0003084083,0.0003599988,0.000485918,0.001822311,0.00004549922,0.00001673623],"category_scores_gemma":[0.00003429111,0.000137259,0.00003975088,0.001146895,0.00009584495,0.001276051,0.0009008271,0.0002263268,0.000376321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001174496,"about_ca_system_score_gemma":0.000140832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001364045,"about_ca_topic_score_gemma":0.00002908583,"domain_scores_codex":[0.9976779,0.0001464832,0.0003640598,0.0006099741,0.0007690159,0.0004326066],"domain_scores_gemma":[0.9984886,0.000120613,0.0000293518,0.0008825806,0.0003591187,0.0001197551],"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.00001447404,0.0005887186,0.0001101315,0.00005642243,0.00006481408,0.00002438343,0.01134712,0.5383688,0.04314558,0.04878661,0.01370444,0.3437885],"study_design_scores_gemma":[0.0002296848,0.000130815,0.0001831599,0.00006741907,0.000002951946,0.000006036867,0.000123903,0.991071,0.002813478,0.0001979187,0.005004167,0.0001694457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003981165,0.00004696593,0.9900962,0.003010568,0.00004987969,0.000968785,0.00002405986,0.00009659671,0.001725757],"genre_scores_gemma":[0.4103242,0.0000142879,0.5878755,0.000305236,0.0001458193,0.0002658107,0.00008809169,0.00001536911,0.0009655795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4527022,"threshold_uncertainty_score":0.5597262,"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."}}