{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002454945,0.002143799,0.001866354,0.0008343383,0.0006107169,0.001007593,0.00201509,0.002038771,0.004673318],"category_scores_gemma":[0.01146151,0.0008894877,0.001303113,0.0009466332,0.001119935,0.001503214,0.00156799,0.00314799,0.0007632963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178333,"about_ca_system_score_gemma":0.001666129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003882647,"about_ca_topic_score_gemma":0.005386961,"domain_scores_codex":[0.9985437,0.0006364006,0.00009191893,0.0003303562,0.0002150645,0.0001825603],"domain_scores_gemma":[0.9929941,0.005709908,0.0003512623,0.000375692,0.0004398611,0.0001291683],"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.00006264238,0.0001132488,0.0009282597,0.0002024384,0.00006971494,0.00006675755,0.00006671719,0.93973,0.0004947449,0.008708715,0.002071084,0.04748574],"study_design_scores_gemma":[0.00002151988,0.00003216538,0.00003948312,0.00001253903,0.000007620837,0.00001260463,0.00001361812,0.9900126,0.0001707956,0.009094565,0.0005793438,0.00000309691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04257697,0.001161571,0.9466876,0.001165072,0.0002282401,0.0002382581,0.0001568537,0.001108666,0.006676722],"genre_scores_gemma":[0.4503539,0.0007413889,0.5409507,0.0007442938,0.0004049317,0.0009334552,0.0007809086,0.0003891877,0.004701189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004673318,"threshold_uncertainty_score":0.01563388,"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."}}