{"id":"W2105075386","doi":"10.1016/s0166-218x(00)00283-3","title":"The vehicle routing problem with pickups and deliveries on some special graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vehicle routing problem; Pickup; Depot; Mathematics; Combinatorics; Routing (electronic design automation); Tree (set theory); Time complexity; Computer science; Graph; Mathematical optimization; Artificial intelligence; Geography","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.0002340544,0.000198319,0.0001856821,0.00003933767,0.0002938707,0.0001399469,0.0001418769,0.00005846117,0.00002357087],"category_scores_gemma":[0.00002210541,0.0001355224,0.0000267197,0.0001652901,0.0001107904,0.00008150148,0.00004003093,0.0001825823,0.00002139333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002617786,"about_ca_system_score_gemma":0.000003262705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.57978e-7,"about_ca_topic_score_gemma":0.000002672316,"domain_scores_codex":[0.9990622,0.00001411342,0.0002532713,0.0001611746,0.000219157,0.0002900166],"domain_scores_gemma":[0.9993444,0.0002364209,0.00006868444,0.0002666761,0.00002086509,0.0000629219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002350289,0.00005204307,0.000102659,0.0002785742,0.0001333122,0.000005197779,0.008639575,0.05784722,0.001512438,0.907006,0.0008744255,0.02352509],"study_design_scores_gemma":[0.001378855,0.0001450139,0.0002407277,0.0001966986,0.0001105067,0.0000219583,0.003245146,0.9291613,0.00549461,0.05709059,0.00200824,0.000906334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.65567,0.0004813968,0.122019,0.0006325226,0.0002974605,0.002038658,0.00003109344,0.001754257,0.2170756],"genre_scores_gemma":[0.7617064,0.0002451434,0.237323,0.00007656884,0.0002295483,0.00008287282,0.000003927328,0.0001245208,0.0002080834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8713141,"threshold_uncertainty_score":0.5526444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122501856583811,"score_gpt":0.2077766695531804,"score_spread":0.1955264838947993,"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."}}