{"id":"W2954633348","doi":"10.1016/j.ejor.2019.06.032","title":"A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Transport Canada","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Pickup; Benchmark (surveying); Vehicle routing problem; Computer science; Column generation; Branch and cut; Operations research; Service (business); Routing (electronic design automation); Mathematical optimization; Algorithm; Integer programming; Business; Mathematics; Computer network; Marketing","routes":{"ca_aff":true,"ca_fund":true,"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.001125029,0.0001039022,0.0001399987,0.00009065645,0.0001931095,0.0001258403,0.00008894678,0.00001878497,0.00004129699],"category_scores_gemma":[0.0000230262,0.000065068,0.00001904216,0.00006710641,0.0002093007,0.0001760887,0.00003496082,0.0002777133,0.00001750778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002902208,"about_ca_system_score_gemma":0.0000436199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004298178,"about_ca_topic_score_gemma":0.000005388871,"domain_scores_codex":[0.9990989,0.00009906798,0.0002042197,0.0001191341,0.0002896801,0.0001890082],"domain_scores_gemma":[0.9992123,0.0003319144,0.00002490606,0.00006641862,0.0002505617,0.0001139068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.007615449,0.0006919179,0.1334179,0.004556286,0.006947475,0.001523283,0.05863445,0.2293947,0.1397956,0.01086408,0.04376405,0.3627947],"study_design_scores_gemma":[0.0111636,0.002579544,0.1094234,0.0003539751,0.0001289701,0.001314729,0.0009802133,0.65016,0.001044552,0.00007880645,0.2219758,0.000796471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9638194,0.008237372,0.02257529,0.0004357104,0.00008129022,0.0008256653,0.000148131,0.00002170741,0.003855391],"genre_scores_gemma":[0.9831966,0.00159464,0.007986287,0.0000391354,0.000109414,0.000004948428,0.000007282724,0.00003169851,0.007029993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4207653,"threshold_uncertainty_score":0.2653396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05003301532035377,"score_gpt":0.2597200634692248,"score_spread":0.209687048148871,"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."}}