{"id":"W2335850549","doi":"10.1080/03155986.2016.1166793","title":"The pickup and delivery problem with time windows and scheduled lines","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"TKI DINALOG; Technische Universiteit Eindhoven","keywords":"Pickup; Public transport; Vehicle routing problem; Computer science; Transport engineering; Integer programming; Set (abstract data type); Routing (electronic design automation); Operations research; Destinations; Line (geometry); Business; Engineering; Computer network; Tourism; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635523,0.00008779986,0.00009478284,0.0001269572,0.0004348916,0.0006333117,0.00006464411,0.00006075052,0.000007303426],"category_scores_gemma":[0.000170555,0.00004572151,0.000006591044,0.0001468987,0.0001334732,0.001403053,0.00005112391,0.0001063695,0.00003056223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003353853,"about_ca_system_score_gemma":0.00007055846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002194274,"about_ca_topic_score_gemma":0.000005340936,"domain_scores_codex":[0.998987,0.00006882232,0.0003046798,0.0000694317,0.0003845454,0.0001855907],"domain_scores_gemma":[0.9987552,0.0005061004,0.00003203077,0.00009810295,0.0005243692,0.00008424166],"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.0006167757,0.00002762144,0.03239412,0.001794753,0.0004933181,0.000003977237,0.009110386,0.276272,0.006987833,0.2106288,0.01087601,0.4507945],"study_design_scores_gemma":[0.001686482,0.0001486035,0.006318756,0.0002924411,0.000005823338,0.00009222831,0.0007733442,0.87921,0.0003981194,0.0000720617,0.1107386,0.0002635604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8804243,0.002030263,0.09149251,0.00281376,0.0002061334,0.003078823,0.00009554207,0.0003425817,0.01951609],"genre_scores_gemma":[0.9881694,0.0007104367,0.009422584,0.00004857131,0.0001083503,0.0001807657,0.00001820542,0.0000158951,0.001325789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.602938,"threshold_uncertainty_score":0.6107039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279345455576845,"score_gpt":0.2916587786160583,"score_spread":0.2637242330583738,"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."}}