{"id":"W52155069","doi":"10.1007/978-3-642-56423-9_15","title":"Adaptive Memory Programming for a Class of Demand Responsive Transit Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in economics and mathematical systems","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Schedule; Mathematical optimization; Heuristic; Set (abstract data type); Public transport; Class (philosophy); Service (business); Order (exchange); Operations research; Distributed computing; Engineering; Transport engineering; Artificial intelligence; Mathematics; Economics","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.001136275,0.001298549,0.001431652,0.0005002257,0.0004986925,0.001839225,0.001889071,0.001995908,0.006173554],"category_scores_gemma":[0.004457583,0.0005640117,0.001008977,0.0008075258,0.001173187,0.001585823,0.001268825,0.002599315,0.0003730011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100923,"about_ca_system_score_gemma":0.001003799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003596349,"about_ca_topic_score_gemma":0.002455909,"domain_scores_codex":[0.999564,0.0001356917,0.0000163297,0.0001095608,0.00006815412,0.0001062369],"domain_scores_gemma":[0.9983388,0.001220711,0.0001383745,0.00006467803,0.0001409026,0.00009639461],"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.0001305595,0.00008546767,0.0003491352,0.0001805904,0.00007233245,0.0001591963,0.0001306401,0.5904685,0.001443906,0.3758373,0.005633286,0.02550922],"study_design_scores_gemma":[0.00001905135,0.00002606548,0.00005650147,0.000007795146,0.0000100971,0.00001707544,0.00001558942,0.9153427,0.0001049282,0.08384926,0.000543319,0.000007579188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03972138,0.0009500924,0.9417087,0.001210762,0.000124054,0.00007833589,0.0002240273,0.0002118497,0.01577065],"genre_scores_gemma":[0.8846626,0.001786886,0.06530753,0.0004321555,0.0003600153,0.0003855944,0.0003185655,0.0001413875,0.04660519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006173554,"threshold_uncertainty_score":0.02065259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01805864478256067,"score_gpt":0.2153114538528881,"score_spread":0.1972528090703274,"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."}}