{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002629673,0.0002820949,0.00075994,0.0001780479,0.00002953435,0.00003965435,0.00008171384,0.0004173514,0.000007332452],"category_scores_gemma":[0.00002956901,0.0002743414,0.0001079002,0.00003261056,0.0000744654,0.00004482648,0.000005177341,0.0002039513,0.000002142283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008862708,"about_ca_system_score_gemma":0.00003748622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001149723,"about_ca_topic_score_gemma":0.000116315,"domain_scores_codex":[0.9986409,0.000009353127,0.0008543777,0.000240953,0.00005987785,0.0001945338],"domain_scores_gemma":[0.9989986,0.0004999291,0.000153966,0.0002029909,0.00008241681,0.00006213783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000673028,0.000027591,0.000003463152,0.003346381,0.0003121742,0.000004391589,0.001034627,0.2046343,0.00004358878,0.7830264,0.00001653628,0.007483265],"study_design_scores_gemma":[0.002843905,0.0004681083,0.0000242552,0.004345652,0.0005815658,0.0001462397,0.0005254534,0.715639,0.0002275662,0.1531706,0.1202182,0.001809392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00479207,0.003564012,0.9435902,0.00009618931,0.0006826498,0.004576716,0.0005288821,0.0001446292,0.04202462],"genre_scores_gemma":[0.9937798,0.0006549627,0.002843301,0.00002288395,0.0001895562,0.0004523065,0.00009696077,0.0001419852,0.001818207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9889877,"threshold_uncertainty_score":0.9999709,"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."}}