{"id":"W2148047235","doi":"10.1504/ijmheur.2014.068904","title":"Nonlinear threshold accepting meta-heuristic for combinatorial optimisation problems","year":2014,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Mathematical optimization; Neighbourhood (mathematics); Hill climbing; Simulated annealing; Heuristic; Nonlinear system; Local search (optimization); Algorithm; Filter (signal processing); Tabu search; Mathematics; Artificial intelligence","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.0006042895,0.0001795616,0.0003554352,0.0001455352,0.00005094176,0.00009675969,0.0003793313,0.00007962251,0.00003038462],"category_scores_gemma":[0.001114321,0.0001574399,0.000218056,0.00005643604,0.00003357786,0.000182434,0.00002805045,0.0002235262,0.000003939495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008268729,"about_ca_system_score_gemma":0.00002193619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.216116e-7,"about_ca_topic_score_gemma":7.081973e-7,"domain_scores_codex":[0.9985836,0.00002670945,0.0006744268,0.0001146103,0.0004335167,0.0001671901],"domain_scores_gemma":[0.998274,0.0003924732,0.00035454,0.0001032945,0.0007965275,0.00007916075],"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.00003702485,0.0000484498,0.00002024242,0.00003767253,0.0008140307,0.000003358593,0.0000593113,0.9885485,0.0001625184,0.00770781,0.0006956791,0.001865391],"study_design_scores_gemma":[0.001833725,0.0002280077,0.00005401296,0.00004271133,0.001227535,0.00005209736,0.00002336171,0.9091272,0.004407951,0.05149243,0.03119356,0.0003173644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002138729,0.0002348503,0.9920673,0.0001060375,0.004327121,0.000134838,0.00003480859,0.00006969786,0.0008866442],"genre_scores_gemma":[0.8118135,0.0001692416,0.1863404,0.00004643426,0.001496622,0.00001056817,0.00003421929,0.000043479,0.00004554167],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8096747,"threshold_uncertainty_score":0.6420214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03353671793684426,"score_gpt":0.2730317602403623,"score_spread":0.239495042303518,"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."}}