{"id":"W2128811073","doi":"10.1287/ijoc.1110.0454","title":"A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Computer science; Hybrid algorithm (constraint satisfaction); Algorithm; Mathematical optimization; Constraint programming; Guided Local Search; Scheduling (production processes); Constraint (computer-aided design); Heuristic; Dynamic programming; Constraint logic programming; Mathematics; Stochastic programming","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":[],"consensus_categories":[],"category_scores_codex":[0.001827925,0.000179404,0.000190743,0.0001288871,0.000430494,0.0002433926,0.0002119163,0.00004893755,0.000009111903],"category_scores_gemma":[0.0000887221,0.0001250767,0.00008188407,0.0001286766,0.00008034277,0.0001880958,0.00006174322,0.0005602496,0.000003435536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008936616,"about_ca_system_score_gemma":0.00004760718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000636708,"about_ca_topic_score_gemma":6.612322e-7,"domain_scores_codex":[0.9987023,0.00003165912,0.0004787406,0.0001184573,0.0002109475,0.000457911],"domain_scores_gemma":[0.9991105,0.0003904828,0.000105107,0.0001265051,0.0001344765,0.0001329146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000603247,0.000008340708,0.0001097547,0.0000300461,0.00005653011,0.000009440409,0.00111436,0.1308554,0.00002113496,0.0001328344,0.00001287539,0.8676432],"study_design_scores_gemma":[0.0005311032,0.0001131703,0.0004293078,0.0001265011,0.00001717771,0.0006141662,0.0003055953,0.9964895,0.0004041837,0.0001881923,0.0006077685,0.0001733843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0588155,0.0001088221,0.9396354,0.0000456576,0.0003395802,0.0004335759,0.000003925754,0.0001748195,0.0004427303],"genre_scores_gemma":[0.3922009,0.00003663921,0.6075225,0.00005252203,0.0001336525,0.000006810636,0.000001496293,0.00003368752,0.00001172986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8674698,"threshold_uncertainty_score":0.5100479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02565423053011042,"score_gpt":0.2752020308302267,"score_spread":0.2495478003001163,"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."}}