{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00966566,0.00008168927,0.0001196002,0.00007948889,0.0002577271,0.00009913906,0.0003341011,0.00001890152,0.000009811237],"category_scores_gemma":[0.001016512,0.00004550275,0.00004314879,0.0003154542,0.0001192622,0.0002012871,0.00007930776,0.0003958386,0.000006248651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007378439,"about_ca_system_score_gemma":0.000176235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000331198,"about_ca_topic_score_gemma":9.577672e-7,"domain_scores_codex":[0.9978564,0.0008137525,0.0003700859,0.00009006757,0.0006671921,0.0002025024],"domain_scores_gemma":[0.9978849,0.0005739167,0.0001015414,0.0001404153,0.001210823,0.00008840073],"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.0000925451,0.00003642259,0.0009931052,0.00002672706,0.00008228731,0.000003847543,0.001422594,0.9703022,0.01480649,0.0002421793,0.001279068,0.01071258],"study_design_scores_gemma":[0.001627009,0.0002180154,0.007770737,0.0001023178,0.00001497059,0.00007990412,0.0001451974,0.9846857,0.003281341,0.000026524,0.00196765,0.0000805942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07417467,0.0007371271,0.9193482,0.002612283,0.000158865,0.0007275891,0.00001141242,0.00002617842,0.002203694],"genre_scores_gemma":[0.8426799,0.00002055669,0.1564333,0.00003023928,0.0002653519,0.000004878195,0.000001322546,0.00004017063,0.0005242748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7685052,"threshold_uncertainty_score":0.3349944,"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."}}