{"id":"W4389738699","doi":"10.1002/net.22200","title":"Learning to repeatedly solve routing problems","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Focus (optics); Routing (electronic design automation); Optimization problem; Resolution (logic); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics","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.0007197172,0.0001265426,0.0001404374,0.000103687,0.0001225066,0.00006401489,0.0001228417,0.0001090721,0.00003168608],"category_scores_gemma":[0.0001487585,0.0001424409,0.00003987798,0.001054284,0.000007499088,0.00006370975,0.00006719781,0.0003524102,0.0002034121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004864028,"about_ca_system_score_gemma":0.000005739936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005269658,"about_ca_topic_score_gemma":0.000002704034,"domain_scores_codex":[0.9989678,0.00005016053,0.0002249877,0.000193908,0.0001233208,0.0004398382],"domain_scores_gemma":[0.9995381,0.0001213108,0.00002419856,0.0001779184,0.00003770548,0.0001007534],"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.000001054164,0.00000130106,0.001753771,0.00001005435,0.00001208501,0.000003990783,0.0006215654,0.967877,0.0002212759,0.00003736861,0.002320602,0.02713993],"study_design_scores_gemma":[0.00009494781,0.00001911348,0.001176192,0.00006174202,0.000005370688,0.000002372149,0.00009235489,0.9943155,0.00008365681,0.00001812831,0.00396698,0.0001636112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06410789,0.00007429473,0.918537,0.0001122733,0.0007880369,0.0002570542,5.818101e-7,0.00534207,0.01078081],"genre_scores_gemma":[0.963487,0.00005497934,0.03462907,0.00008203613,0.0004262966,0.00003496307,0.00002151403,0.0001069233,0.001157209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8993791,"threshold_uncertainty_score":0.5808573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01633280587669093,"score_gpt":0.2509699629027951,"score_spread":0.2346371570261042,"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."}}