{"id":"W2603251541","doi":"10.1002/net.20332","title":"A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Heuristic; Set (abstract data type); Computer science; Diversification (marketing strategy); Routing (electronic design automation); Algorithm; 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.0009955823,0.0005275292,0.001286448,0.000811434,0.000503631,0.000665213,0.001217187,0.0008694283,0.002653736],"category_scores_gemma":[0.001807681,0.000441239,0.0004399895,0.0009612215,0.0004609309,0.001083001,0.0007461175,0.0006636183,0.0003251704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008477786,"about_ca_system_score_gemma":0.001243219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005556566,"about_ca_topic_score_gemma":0.005035072,"domain_scores_codex":[0.9996319,0.0001798846,0.00001366613,0.00005883732,0.00007589481,0.00003978665],"domain_scores_gemma":[0.9994596,0.0003795603,0.0000477751,0.00002182921,0.00005426768,0.00003702767],"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.0002117068,0.0001477415,0.000451026,0.00007103723,0.00004438872,0.0000526489,0.00007326571,0.8778724,0.0009377545,0.01550389,0.002676941,0.1019571],"study_design_scores_gemma":[0.00003844256,0.0000332078,0.00004205184,0.000003720046,0.000004808252,0.000009687506,0.000006338328,0.997308,0.0001499767,0.001981919,0.0004191949,0.000002726172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0559274,0.0007552603,0.9371992,0.0003253679,0.00005589838,0.0001744911,0.00008617018,0.0003702595,0.005105963],"genre_scores_gemma":[0.3635431,0.0003402247,0.6305243,0.00009100266,0.00004813519,0.0005303119,0.0002742233,0.00008938885,0.004559322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005556566,"threshold_uncertainty_score":0.01104844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009967092434046134,"score_gpt":0.2421302769561041,"score_spread":0.2321631845220579,"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."}}