{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009066975,0.0002088647,0.0004535786,0.0001379886,0.00006512141,0.00005622611,0.000139608,0.00008631195,0.0001877411],"category_scores_gemma":[0.00008952143,0.00019664,0.0001070882,0.0004667658,0.00006197251,0.0002413715,0.00004014231,0.0001285624,0.00000816226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109142,"about_ca_system_score_gemma":0.00003538073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006462596,"about_ca_topic_score_gemma":0.00001509997,"domain_scores_codex":[0.9982991,0.0002489492,0.0006543626,0.000243059,0.0002576783,0.0002968623],"domain_scores_gemma":[0.9991194,0.0001172308,0.00008305177,0.0003627712,0.0002559348,0.00006158707],"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.000007636896,0.00003481263,0.0008590343,0.0002194163,0.0001312788,0.000001511651,0.00005565427,0.9965345,0.001916371,0.0001700885,0.00003899074,0.00003067752],"study_design_scores_gemma":[0.0003116266,0.00001274665,0.0002997003,0.00001209481,0.000150611,0.000009199814,0.00003397776,0.9969761,0.001959032,0.00001224832,0.00003538746,0.0001872873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02103748,0.0003465464,0.9763858,0.000007889445,0.0001661642,0.0003749529,0.00002466573,0.0004024884,0.00125396],"genre_scores_gemma":[0.3051437,0.0000167972,0.6938835,0.000002617231,0.00002549437,0.00001399239,0.00001638911,0.00004935791,0.000848069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2841063,"threshold_uncertainty_score":0.8018746,"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."}}