{"id":"W2107813763","doi":"10.1109/icec.1996.542676","title":"A scatter search approach for unconstrained continuous optimization","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Exploit; Computer science; Bridge (graph theory); Population; Simple (philosophy); Genetic algorithm; Guided Local Search; Evolutionary algorithm; Hill climbing; Local search (optimization); Mathematical optimization; Artificial intelligence; Algorithm; Machine learning; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005543467,0.0001284368,0.0001772358,0.0002091093,0.0001498999,0.0003521706,0.0007727998,0.00006623366,0.0009703396],"category_scores_gemma":[0.0001675995,0.0001121367,0.00006759897,0.0006039213,0.00007819688,0.0003617471,0.000155095,0.0001046618,0.00007515302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003490602,"about_ca_system_score_gemma":0.0000378439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006285762,"about_ca_topic_score_gemma":1.839246e-7,"domain_scores_codex":[0.9983143,0.0001013549,0.0002611504,0.0004711142,0.0004414303,0.0004106254],"domain_scores_gemma":[0.9987085,0.0001723959,0.00004194571,0.0005235559,0.0003965934,0.0001570322],"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.00001167016,0.0005868829,0.0001624459,0.00008452682,0.00007573204,0.000008114068,0.0007109744,0.7867905,0.00009308825,0.05840277,0.03582394,0.1172493],"study_design_scores_gemma":[0.0006576706,0.000061192,0.000006065566,0.000002056563,0.000002961296,0.00001512001,0.00002805015,0.9981625,0.0002253467,0.00006389472,0.0006346562,0.0001404763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001088273,0.00002865225,0.9574506,0.001525369,0.00008253701,0.0006881318,0.000004373346,0.0002033112,0.04000612],"genre_scores_gemma":[0.01308802,0.00001005648,0.9735674,0.0003966384,0.00006447059,0.0001049121,0.00001733202,0.00001510058,0.01273601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.211372,"threshold_uncertainty_score":0.9999429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04920930437619273,"score_gpt":0.2708317693192688,"score_spread":0.2216224649430761,"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."}}