{"id":"W1853087932","doi":"10.1016/j.ejor.2015.08.040","title":"Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":97,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Vehicle routing problem; Computer science; Mutual exclusion; Discretization; Set (abstract data type); Branch and price; Contrast (vision); Duration (music); Mathematical optimization; Dynamic programming; Routing (electronic design automation); Sequence (biology); Operations research; Algorithm; Integer programming; Mathematics; Theoretical computer science; Artificial intelligence; Parallel computing","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.003436897,0.001945899,0.002524542,0.00172763,0.00125078,0.00191809,0.002561704,0.002865443,0.008195674],"category_scores_gemma":[0.009089155,0.001385713,0.00130763,0.002891907,0.001372047,0.003235677,0.001979967,0.004230776,0.001070371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00192076,"about_ca_system_score_gemma":0.003506127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01212329,"about_ca_topic_score_gemma":0.01089077,"domain_scores_codex":[0.9989477,0.000509339,0.00005287514,0.00009285427,0.0002254914,0.0001717875],"domain_scores_gemma":[0.995455,0.003859533,0.0001517491,0.0001138929,0.0002514919,0.0001683176],"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.0003076397,0.0002280028,0.0003296867,0.0001990298,0.00009306934,0.00005371369,0.0001048055,0.8253332,0.0005043978,0.05439546,0.005701542,0.1127495],"study_design_scores_gemma":[0.00005842374,0.00003894407,0.00005238528,0.0000142287,0.00001454703,0.000007461674,0.00001216071,0.9786012,0.000139672,0.02033127,0.0007233183,0.000006457984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008917463,0.00145435,0.9839001,0.0004688387,0.0001554061,0.000134229,0.00008540952,0.0003076798,0.004576515],"genre_scores_gemma":[0.2153709,0.002404748,0.7713084,0.0002264274,0.0002501523,0.000813876,0.0003307807,0.0003975486,0.008897147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01212329,"threshold_uncertainty_score":0.02741724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1111965887103439,"score_gpt":0.3481672686388506,"score_spread":0.2369706799285067,"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."}}