{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264612,0.000995183,0.001108926,0.001359284,0.0008361752,0.001201283,0.002184279,0.00132291,0.004858769],"category_scores_gemma":[0.002939618,0.0006999269,0.0007680448,0.002781625,0.0006232615,0.001319975,0.0009665797,0.001296192,0.001128568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009651723,"about_ca_system_score_gemma":0.00205233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01249953,"about_ca_topic_score_gemma":0.01006772,"domain_scores_codex":[0.9990832,0.0003712072,0.00004013865,0.0001300654,0.0002769995,0.0000984029],"domain_scores_gemma":[0.9989623,0.0006369157,0.00006759032,0.00008820032,0.0002033419,0.00004159578],"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.0001630759,0.0001431123,0.0005258476,0.0001306799,0.0001001864,0.00006540255,0.00008288277,0.6726028,0.002259991,0.01745986,0.00548922,0.3009769],"study_design_scores_gemma":[0.00004336234,0.00003299563,0.00008418765,0.000008651229,0.00001132457,0.00003534267,0.00001434076,0.992699,0.0005812852,0.004001889,0.002476771,0.0000109216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006377932,0.000267619,0.9893401,0.00009758426,0.00003533054,0.0000981873,0.00009140741,0.0009244128,0.00276748],"genre_scores_gemma":[0.07193065,0.000186044,0.9246969,0.0001286597,0.0000284139,0.0003265851,0.0002775192,0.0002617009,0.002163389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249953,"threshold_uncertainty_score":0.02485359,"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."}}