{"id":"W4401011606","doi":"10.1007/s00500-024-09896-5","title":"A co-evolutionary algorithm with adaptive penalty function for constrained optimization","year":2024,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Verafin (Canada)","funders":"Università degli Studi di Trento","keywords":"Metaheuristic; Mathematical optimization; Penalty method; Computer science; Evolutionary algorithm; Optimization problem; Constrained optimization; Benchmark (surveying); 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.001091166,0.0008905682,0.001055525,0.001156876,0.0003867357,0.0007645236,0.001195175,0.001652708,0.001795599],"category_scores_gemma":[0.002707079,0.0004060626,0.0007156957,0.0009799354,0.0006526731,0.0005719142,0.001209155,0.001038854,0.0002812251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005870515,"about_ca_system_score_gemma":0.0008893488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035696,"about_ca_topic_score_gemma":0.002188581,"domain_scores_codex":[0.9994659,0.0001956788,0.00003006747,0.00008011395,0.0001724286,0.00005595416],"domain_scores_gemma":[0.9989091,0.0006899298,0.00007376775,0.00007943857,0.0001912425,0.0000565454],"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.00004974335,0.00008831319,0.00072367,0.0000420845,0.00004913274,0.00005603221,0.00003651479,0.9426775,0.002311941,0.006222753,0.0006322164,0.04711008],"study_design_scores_gemma":[0.000008552166,0.00001406781,0.00004433073,0.000002744842,0.000003467073,0.000009612011,0.00000215154,0.9989429,0.0001946884,0.0004966281,0.0002787198,0.000002137901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05105768,0.0004478977,0.9424623,0.0002922502,0.00009716393,0.00008952987,0.00003689341,0.0003217884,0.005194505],"genre_scores_gemma":[0.5278427,0.0002335189,0.4665042,0.0002721673,0.00005292549,0.0003724076,0.0001631877,0.0001388082,0.004420088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003035696,"threshold_uncertainty_score":0.006036043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02337172264000821,"score_gpt":0.28811614323647,"score_spread":0.2647444205964618,"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."}}