{"id":"W2886351742","doi":"10.1016/j.endm.2018.07.043","title":"A hybrid heuristic for the multi-activity tour scheduling problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Heuristic; Incremental heuristic search; Beam search; Time horizon; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Schedule","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.0006854715,0.0006985961,0.0009847812,0.001139234,0.0005050431,0.001013511,0.001766715,0.001320459,0.006209776],"category_scores_gemma":[0.001216652,0.0005023034,0.0007554963,0.001196318,0.0004100867,0.0009099347,0.0009851243,0.0007248886,0.0005726074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008674684,"about_ca_system_score_gemma":0.001361776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004076378,"about_ca_topic_score_gemma":0.005730472,"domain_scores_codex":[0.9995691,0.0001357576,0.00001918069,0.00005906648,0.0001238249,0.00009300752],"domain_scores_gemma":[0.9993173,0.0004201931,0.00004294469,0.0000576554,0.00008671717,0.00007529937],"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.0003398495,0.0003103426,0.0006113139,0.0001894452,0.00009151464,0.0001412663,0.00007188856,0.8423797,0.004718323,0.01048603,0.002577375,0.1380831],"study_design_scores_gemma":[0.00007952908,0.0001137712,0.0001650016,0.00001028694,0.00002707384,0.00003262214,0.00002191083,0.9951096,0.0006119511,0.002462127,0.001354885,0.00001135624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1059809,0.0007204256,0.8760058,0.000336408,0.0002721313,0.0003316662,0.0002981942,0.001211543,0.01484299],"genre_scores_gemma":[0.5223924,0.0002885395,0.4689175,0.0001997413,0.00008467595,0.0004754683,0.0003762412,0.0001776447,0.007087742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006209776,"threshold_uncertainty_score":0.02077371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1046580400747033,"score_gpt":0.3967873945184167,"score_spread":0.2921293544437134,"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."}}