{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000428078,0.0006792814,0.0006270766,0.0005594861,0.0003222733,0.0006437605,0.0005090568,0.0007309549,0.003435569],"category_scores_gemma":[0.001065199,0.0002815274,0.0005222047,0.001033401,0.000733091,0.0006877738,0.0009976816,0.0008102954,0.0007445421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003075284,"about_ca_system_score_gemma":0.0005384419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255309,"about_ca_topic_score_gemma":0.001403221,"domain_scores_codex":[0.9998205,0.00005480491,0.000006470441,0.0000211163,0.00008438913,0.0000127406],"domain_scores_gemma":[0.9997681,0.0001226896,0.00001465747,0.00002625657,0.00005443248,0.00001383458],"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.00004917978,0.00003958764,0.0003747559,0.00009161377,0.00005003072,0.00006998407,0.00006815868,0.8106753,0.005305491,0.09555146,0.00249271,0.08523164],"study_design_scores_gemma":[0.00001621313,0.00005588148,0.00008423443,0.00001414062,0.000008349228,0.00004008077,0.000009795767,0.9662696,0.0009687315,0.02765276,0.004872428,0.00000788654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003137185,0.0002453032,0.9928376,0.0000692039,0.00002339393,0.0000174429,0.00001554163,0.00008068993,0.003573775],"genre_scores_gemma":[0.3124288,0.001348875,0.6699297,0.0002504433,0.0001426075,0.0004704264,0.0002149622,0.0002331171,0.01498102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003435569,"threshold_uncertainty_score":0.01149315,"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."}}