{"id":"W4401072134","doi":"10.1016/j.trb.2024.103027","title":"Approximate dynamic programming for pickup and delivery problem with crowd-shipping","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Markov decision process; Dynamic programming; Mathematical optimization; Matching (statistics); Scalability; Bellman equation; Convergence (economics); Stochastic programming; Pickup; Markov process; Function (biology); Operations research; Engineering; Mathematics; Algorithm; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001951813,0.001588479,0.002483559,0.0006994688,0.0007623524,0.002020324,0.001555095,0.002263389,0.004529552],"category_scores_gemma":[0.005605846,0.0009103505,0.00110524,0.001211665,0.001159557,0.001563439,0.001718316,0.002367408,0.0004054576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001943544,"about_ca_system_score_gemma":0.002594895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01590053,"about_ca_topic_score_gemma":0.007596076,"domain_scores_codex":[0.9990344,0.0003346239,0.00004292533,0.0002030599,0.0001710952,0.0002139584],"domain_scores_gemma":[0.9963868,0.002759571,0.0003038606,0.00008517443,0.0002667336,0.0001979037],"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.00003174402,0.00001638105,0.0001591654,0.00003979109,0.00001266926,0.00004741755,0.00001615547,0.9907609,0.0001033744,0.00568524,0.0004044891,0.002722782],"study_design_scores_gemma":[0.000005623663,0.00001012197,0.00002866853,0.000003900334,0.00000322893,0.00000595958,0.000008730908,0.9967709,0.00003893357,0.002931059,0.0001901169,0.000002697975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0278236,0.0007472603,0.9631572,0.0008665008,0.0001353838,0.0001065525,0.0002345999,0.0002085296,0.006720404],"genre_scores_gemma":[0.8627173,0.0009606772,0.1269959,0.000388805,0.0001126215,0.0003712024,0.0003869802,0.0001284814,0.007937986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01590053,"threshold_uncertainty_score":0.03161591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2657432137070771,"score_gpt":0.4298331329529043,"score_spread":0.1640899192458272,"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."}}