{"id":"W2070349606","doi":"10.1016/j.dam.2011.05.014","title":"The periodic capacitated arc routing problem with irregular services","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Arc routing; Heuristic; Arc (geometry); Routing (electronic design automation); Hierarchy; Time horizon; Mathematics; Cover (algebra); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Computer science; Computer network; 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.0009263406,0.0005847234,0.001014747,0.0005923358,0.0005949975,0.001298283,0.002031259,0.001703323,0.004482219],"category_scores_gemma":[0.004064241,0.0006734277,0.0008752987,0.001349429,0.001007154,0.001866538,0.0009584278,0.00118403,0.000292562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242258,"about_ca_system_score_gemma":0.001087899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004738898,"about_ca_topic_score_gemma":0.003836303,"domain_scores_codex":[0.9994168,0.0001933477,0.00002271206,0.0001390765,0.0001019393,0.0001259776],"domain_scores_gemma":[0.9986019,0.0007834418,0.000226442,0.0001477549,0.00009328608,0.0001471533],"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.0001570446,0.00004493969,0.0004605577,0.00008101147,0.00003377318,0.0002276343,0.00003798457,0.9198226,0.0006579511,0.06519589,0.002253245,0.01102745],"study_design_scores_gemma":[0.0000169163,0.00002338306,0.0001616674,0.000005376443,0.00001105794,0.0000614052,0.00003024372,0.9627104,0.0001891302,0.03596248,0.0008203947,0.000007509398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2970672,0.0008305605,0.6788093,0.002054942,0.0002949718,0.0001195885,0.0008152623,0.0002848215,0.0197233],"genre_scores_gemma":[0.9194157,0.0005780314,0.06454176,0.0001129019,0.0001732565,0.00009521683,0.0004013231,0.0001169533,0.01456481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004738898,"threshold_uncertainty_score":0.0149945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01479445286339189,"score_gpt":0.2109133992018409,"score_spread":0.196118946338449,"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."}}