{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","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.003635863,0.00215142,0.002133409,0.001415931,0.001031131,0.003710793,0.002458785,0.002351137,0.008164994],"category_scores_gemma":[0.007110833,0.001793191,0.001631629,0.00254125,0.001441832,0.004132433,0.001740441,0.00377647,0.0007569885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0032,"about_ca_system_score_gemma":0.002538991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01087178,"about_ca_topic_score_gemma":0.007358776,"domain_scores_codex":[0.9983317,0.0008809216,0.00006390107,0.000204776,0.0002689625,0.0002496723],"domain_scores_gemma":[0.9953241,0.003777651,0.0003614108,0.0001344522,0.0002280554,0.0001744128],"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.00008504208,0.00006971102,0.0001711459,0.00005642012,0.00003061809,0.00003820166,0.00005113639,0.9426184,0.0001947682,0.04624123,0.001181663,0.009261613],"study_design_scores_gemma":[0.00002380794,0.00001565619,0.00002354054,0.000009629061,0.000007919782,0.000005808871,0.00001158898,0.9787162,0.0001114183,0.02048378,0.0005871232,0.000003547429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02977185,0.00145947,0.9590946,0.0006918155,0.0001037036,0.0001926568,0.0002937416,0.0002890999,0.008103068],"genre_scores_gemma":[0.4242588,0.00292712,0.5583687,0.0002412439,0.0002145001,0.001005683,0.0009442765,0.0002912959,0.01174831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01087178,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01662834278793372,"score_gpt":0.2314751382640148,"score_spread":0.2148467954760811,"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."}}