{"id":"W2118128890","doi":"10.1109/icsssm.2006.320760","title":"Availability Optimization of Series-Parallel Multi-State Systems Using a Tabu Search Meta-heuristic","year":2006,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Université de Montréal; Queen's University","funders":"","keywords":"Tabu search; Computer science; Redundancy (engineering); Mathematical optimization; Disjoint sets; Meta heuristic; Series (stratigraphy); Heuristic; Incremental heuristic search; Guided Local Search; Best-first search; Beam search; Algorithm; Set (abstract data type); Search algorithm; Mathematics","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.000714512,0.0005785239,0.0007292941,0.0008978007,0.00042972,0.0006755489,0.0006348309,0.0005321606,0.001457323],"category_scores_gemma":[0.00118485,0.0004590875,0.0005989344,0.000680269,0.0004806437,0.0005755994,0.0004117299,0.0004121908,0.0001543451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008414981,"about_ca_system_score_gemma":0.0006716067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00383728,"about_ca_topic_score_gemma":0.003168371,"domain_scores_codex":[0.9997464,0.0001145382,0.00001200471,0.0000328905,0.00006550114,0.00002854803],"domain_scores_gemma":[0.9995529,0.000263152,0.00007454167,0.00003406598,0.00005978081,0.00001549326],"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.00001463193,0.000008085196,0.00009418399,0.0000133481,0.00001370158,0.00001238228,0.000007995742,0.9917653,0.0004219933,0.001029342,0.00008854242,0.006530446],"study_design_scores_gemma":[0.000006207303,0.00001567027,0.00004599621,0.000002521383,0.000005458037,0.000005205643,0.000004067977,0.9986318,0.0002819475,0.0008621259,0.000137247,0.000001791699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1520989,0.0006237923,0.8377254,0.0001612022,0.00004030789,0.00007108251,0.00009602946,0.0006749777,0.008508231],"genre_scores_gemma":[0.9131417,0.0001758821,0.08498274,0.00003260785,0.00001416248,0.0001113851,0.00006988331,0.00005963475,0.001412053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00383728,"threshold_uncertainty_score":0.007629931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0671351408694801,"score_gpt":0.293350252545344,"score_spread":0.2262151116758639,"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."}}