{"id":"W2086411701","doi":"10.1287/trsc.1100.0336","title":"Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"Canada Research Chairs","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Reduction (mathematics); Dynamic programming; Algorithm; Constraint programming; Stochastic programming; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560666,0.00007871571,0.0001015122,0.00006826027,0.0001655732,0.00004366863,0.0002511354,0.00003238366,0.00001958552],"category_scores_gemma":[0.0001354228,0.00006322387,0.00003315037,0.0008280778,0.0007174388,0.0003212239,0.000002806707,0.000166033,5.148631e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346628,"about_ca_system_score_gemma":0.0001060172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002490998,"about_ca_topic_score_gemma":0.0001041462,"domain_scores_codex":[0.9990136,0.00001711343,0.0003003298,0.0001618782,0.0003207212,0.0001863602],"domain_scores_gemma":[0.9994338,0.0000785212,0.00008147131,0.0002062158,0.0001511073,0.00004895461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003849213,0.00001599697,0.07220712,0.00005269095,0.000004727264,9.907056e-7,0.003799894,0.3187622,0.5745646,0.003257039,4.11155e-7,0.02733043],"study_design_scores_gemma":[0.0003779712,0.0000198788,0.2784878,0.00005905069,0.00003117956,0.00000684266,0.001148689,0.4999749,0.2190696,0.0004132997,0.0001136628,0.000297243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7939838,0.00001096083,0.2052232,0.00001781221,0.0002627469,0.0001576977,0.000004300852,0.00009179426,0.0002476899],"genre_scores_gemma":[0.8321443,0.000002026244,0.1678184,0.000006339651,0.00001616795,0.000003564201,0.000001120938,0.000006839378,0.000001170809],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3554951,"threshold_uncertainty_score":0.2643433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.056624502328832,"score_gpt":0.3409734412008976,"score_spread":0.2843489388720656,"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."}}