{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005308014,0.0002327653,0.0003875842,0.0001885279,0.0005488052,0.0003119665,0.001013323,0.00007163449,0.0001099417],"category_scores_gemma":[0.01489672,0.0001453325,0.0002025435,0.0006806417,0.0002858164,0.0001770606,0.0001572034,0.0003874722,0.0001914912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303429,"about_ca_system_score_gemma":0.0002945053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005423887,"about_ca_topic_score_gemma":0.0003660504,"domain_scores_codex":[0.9971383,0.0001212309,0.0006621759,0.0005105704,0.0006721742,0.0008956105],"domain_scores_gemma":[0.9913447,0.007026703,0.000324536,0.0009388737,0.0002878807,0.00007729918],"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.0008720233,0.004734426,0.006790116,0.0005856683,0.001321056,0.00002723488,0.02509026,0.05509478,0.01232389,0.6666517,0.004307596,0.2222012],"study_design_scores_gemma":[0.0005540203,0.0001448976,0.0002115195,0.00005606969,0.00004960693,0.00001620852,0.0002008871,0.6889595,0.003436892,0.3048906,0.001261482,0.0002182676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1946422,0.0003772154,0.8027242,0.001173415,0.0001927824,0.0006112563,0.0000162831,0.00006799048,0.0001945797],"genre_scores_gemma":[0.8471258,0.00001203135,0.1519149,0.00006337061,0.0002095029,0.0001188073,0.000001785353,0.00002883541,0.0005249691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6524835,"threshold_uncertainty_score":0.9934012,"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."}}