{"id":"W4400338818","doi":"10.1016/j.cor.2024.106761","title":"An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Column generation; Pickup; Computer science; Vehicle routing problem; Mathematical optimization; Solver; Algorithm; Heuristic; Routing (electronic design automation); Mathematics; 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.00116493,0.001196201,0.002058498,0.0008810632,0.0008987015,0.001538341,0.00253778,0.00182816,0.008139267],"category_scores_gemma":[0.002677958,0.001162605,0.001181085,0.001574178,0.0007196784,0.002378212,0.001904382,0.001713511,0.0009493071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001731398,"about_ca_system_score_gemma":0.004169062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01110348,"about_ca_topic_score_gemma":0.01091557,"domain_scores_codex":[0.9991014,0.0001373124,0.00004342421,0.0002109051,0.0002920185,0.0002149102],"domain_scores_gemma":[0.9989123,0.0006340668,0.00007142118,0.0001243985,0.0001778808,0.00007985788],"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.0003491465,0.0002265715,0.0003505491,0.0001833324,0.00005847541,0.0000896319,0.00008521878,0.8154249,0.002903967,0.01863766,0.004792965,0.1568976],"study_design_scores_gemma":[0.0000630849,0.00004104535,0.00006721247,0.000005555784,0.00001104802,0.00002291461,0.00001247194,0.9933001,0.0003301849,0.005467017,0.0006725072,0.000006914905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0152741,0.000313394,0.9785059,0.0001797617,0.0001322531,0.0001350101,0.0001128156,0.0007461425,0.004600598],"genre_scores_gemma":[0.1991789,0.0003011888,0.7941399,0.0001482667,0.0001000434,0.0003561162,0.0003011479,0.0001852171,0.005289236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01110348,"threshold_uncertainty_score":0.02722853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02498626495706781,"score_gpt":0.3248588548248256,"score_spread":0.2998725898677578,"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."}}