{"id":"W2741021238","doi":"10.1287/trsc.2017.0798","title":"Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"TKI DINALOG","keywords":"Pickup; Vehicle routing problem; Mathematical optimization; Computer science; Scheduling (production processes); Set (abstract data type); Path (computing); Shortest path problem; Longest path problem; Public transport; Job shop scheduling; Column generation; Routing (electronic design automation); Mathematics; Theoretical computer science; Engineering; Transport engineering; Computer network","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.00293605,0.001779551,0.001942472,0.001158795,0.0009713789,0.002053893,0.001585755,0.001830174,0.01352672],"category_scores_gemma":[0.004828035,0.0009980962,0.001285399,0.002753885,0.0007974302,0.001888361,0.001217569,0.002939679,0.001666596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00181205,"about_ca_system_score_gemma":0.003572214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009019103,"about_ca_topic_score_gemma":0.009851693,"domain_scores_codex":[0.9990457,0.0004111106,0.00004374728,0.0001506689,0.0001896546,0.0001592325],"domain_scores_gemma":[0.9982835,0.001375464,0.0001049928,0.00004779011,0.0000976446,0.00009063193],"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.0002011796,0.0001823884,0.000664083,0.0004418029,0.0000632604,0.000178181,0.00009847827,0.8564538,0.0007736071,0.06395966,0.0082286,0.06875493],"study_design_scores_gemma":[0.0000541458,0.00004636922,0.0001271223,0.00002731095,0.00001596909,0.00003430807,0.00002307776,0.972607,0.0002283753,0.02398762,0.002840653,0.000008050527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01144223,0.001331533,0.9753554,0.0005884226,0.0001162307,0.0003312213,0.0004481297,0.0002913856,0.01009551],"genre_scores_gemma":[0.194708,0.002435016,0.7865158,0.0001810038,0.0002294415,0.001212573,0.001398888,0.0003746803,0.01294454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01352672,"threshold_uncertainty_score":0.04525137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470324862353725,"score_gpt":0.2542139529624715,"score_spread":0.2395107043389342,"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."}}