{"id":"W1549544518","doi":"10.1002/atr.1296","title":"A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost","year":2014,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Value of time; Travel time; Computer science; Arrival time; Service (business); Task (project management); Window (computing); Operations research; Level of service; Construct (python library); Transport engineering; Simulation; Real-time computing; Engineering; Economics; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022358,0.001448922,0.002170055,0.001468026,0.0009627609,0.001896197,0.002436508,0.002196176,0.01475795],"category_scores_gemma":[0.004669028,0.001035238,0.001157123,0.001706583,0.0007739397,0.002158482,0.001769774,0.00308144,0.001874866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001400104,"about_ca_system_score_gemma":0.00357532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01529615,"about_ca_topic_score_gemma":0.01284519,"domain_scores_codex":[0.9991412,0.000257331,0.00005519633,0.0001437586,0.0002276568,0.0001749139],"domain_scores_gemma":[0.9971949,0.001889974,0.0001294321,0.0001094979,0.0005211947,0.0001549723],"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.00008529527,0.0001108105,0.0004631455,0.0001361192,0.00002949174,0.0001408033,0.00006126405,0.9022951,0.0006643921,0.0157775,0.003838035,0.07639804],"study_design_scores_gemma":[0.00002115197,0.0000144103,0.00002743064,0.000005388012,0.000003040559,0.0000109361,0.00000866254,0.9962156,0.00007217073,0.003073824,0.00054398,0.000003361894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006614107,0.0002147741,0.9880283,0.0002782213,0.00007875233,0.0001819773,0.00008185027,0.0003646976,0.004157396],"genre_scores_gemma":[0.1189219,0.0002605697,0.8729826,0.0001365837,0.000096645,0.0006071471,0.0002823674,0.000334331,0.006377959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01529615,"threshold_uncertainty_score":0.04937029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006874684862293479,"score_gpt":0.2146692647133824,"score_spread":0.2077945798510889,"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."}}