{"id":"W1989456306","doi":"10.1016/j.trc.2010.02.003","title":"A dynamic capacitated arc routing problem with time-dependent service costs","year":2010,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Piecewise linear function; Service (business); Computer science; Arc routing; Mathematical optimization; Interval (graph theory); Heuristic; Routing (electronic design automation); Variable (mathematics); Function (biology); Piecewise; Arc (geometry); Operations research; Mathematics; Computer network; Economics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001413129,0.0002592719,0.0002537361,0.000530518,0.0003148074,0.00009208923,0.0005156259,0.0002663378,0.00008805106],"category_scores_gemma":[0.0001679045,0.0002452381,0.00003674743,0.001813606,0.0002139096,0.0002885865,0.00002144663,0.001503547,0.00007737052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137904,"about_ca_system_score_gemma":0.00006501663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001080716,"about_ca_topic_score_gemma":0.001964343,"domain_scores_codex":[0.9975715,0.00008907425,0.0004340491,0.0004207306,0.0007180565,0.0007665586],"domain_scores_gemma":[0.9985378,0.0002272935,0.00007106581,0.0005381744,0.0005452859,0.00008037897],"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.00009878234,0.0001374083,0.01220014,0.0006040646,0.0002716872,0.0001091354,0.003587628,0.6253718,0.3028828,0.004574705,0.0007502405,0.04941162],"study_design_scores_gemma":[0.001503098,0.0001816149,0.004401817,0.0004982582,0.00005429044,0.00001606944,0.005236347,0.916557,0.06507295,0.001695452,0.003698218,0.001084848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9392198,0.00006650391,0.04575571,0.002133884,0.0001401321,0.001009839,0.00004316996,0.009926975,0.001703932],"genre_scores_gemma":[0.8794923,0.00006787742,0.1198078,0.00001056312,0.00001100782,0.0002367475,0.00009399401,0.00009305125,0.0001866226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2911853,"threshold_uncertainty_score":1,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02377054587477719,"score_gpt":0.3093435218559584,"score_spread":0.2855729759811813,"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."}}