{"id":"W159706599","doi":"","title":"A Hyper-heuristic Approach to the Home Care Scheduling Problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Scheduling (production processes); Heuristic; Computer science; Job shop scheduling; Nurse scheduling problem; Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Artificial intelligence; Computer network; Flow shop scheduling","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001939834,0.000118056,0.0001140172,0.00005613424,0.00008392027,0.0000645622,0.0002014171,0.00004933952,0.00001438191],"category_scores_gemma":[0.00004599837,0.0000863805,0.00003414383,0.0003502762,0.000006772388,0.00004869838,0.00002026316,0.0001440886,0.00005247231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004802325,"about_ca_system_score_gemma":0.00001057889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002987109,"about_ca_topic_score_gemma":7.532055e-7,"domain_scores_codex":[0.9992979,0.00003598067,0.0001554319,0.0001539439,0.0001292773,0.0002274976],"domain_scores_gemma":[0.9995686,0.00003486583,0.00001117586,0.0002615005,0.00005093356,0.00007287085],"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.000001048954,0.000007148434,0.00007965216,0.0000219656,0.000004750592,2.630864e-7,0.001056978,0.980212,0.0002450892,0.001021573,0.0002553751,0.01709414],"study_design_scores_gemma":[0.0001828669,0.00003116869,0.001211859,0.00002021173,0.00001554083,0.00001040788,0.000628189,0.9938022,0.0005100879,0.0001424304,0.003187157,0.000257871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0152401,0.0002789855,0.9095028,0.0002805976,0.00009216849,0.0003039949,0.000001522756,0.0007253873,0.07357442],"genre_scores_gemma":[0.5185081,0.000003868749,0.4810841,0.0001740065,0.00006476529,0.00001142131,0.000002957553,0.00001648073,0.0001343366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.503268,"threshold_uncertainty_score":0.3522495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517234512786209,"score_gpt":0.2429631302065686,"score_spread":0.2277907850787065,"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."}}