{"id":"W3197491224","doi":"10.1109/tnnls.2021.3105937","title":"Multi-Objective Neural Evolutionary Algorithm for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Knapsack problem; Artificial neural network; Evolutionary algorithm; Combinatorial optimization; Travelling salesman problem; Scalability; Mathematical optimization; Artificial intelligence; Heuristics; Optimization problem; Inference; 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.001211381,0.001201679,0.001125054,0.0007642166,0.0004202148,0.0007621965,0.001241295,0.001230468,0.002264126],"category_scores_gemma":[0.002730707,0.0004726845,0.0007286776,0.0007530923,0.0006082475,0.0007416522,0.001085602,0.001619832,0.0003589118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008706453,"about_ca_system_score_gemma":0.001086871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003386029,"about_ca_topic_score_gemma":0.003760612,"domain_scores_codex":[0.9996069,0.0001512116,0.00001992384,0.00006286645,0.0001118709,0.00004725732],"domain_scores_gemma":[0.9992695,0.0004862928,0.00005419478,0.00004524509,0.0001060977,0.00003859189],"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.00002175765,0.00004262171,0.0003522209,0.00004505921,0.00003713507,0.00003847145,0.00002717595,0.9511485,0.0005283575,0.009895736,0.0007278821,0.03713509],"study_design_scores_gemma":[0.000006101141,0.000008739648,0.00002110491,0.000003152457,0.00000248866,0.000005249351,0.000002351381,0.9973882,0.00008705099,0.002170964,0.0003032669,0.000001421322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01026554,0.0003873467,0.9854869,0.0001753939,0.00004243622,0.00005360155,0.00002654299,0.0002392818,0.003323069],"genre_scores_gemma":[0.3027189,0.0004653208,0.6907821,0.0002982925,0.00005711398,0.0005003908,0.0001931065,0.0001442278,0.004840571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003386029,"threshold_uncertainty_score":0.007574201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01462026558779462,"score_gpt":0.2434615643741891,"score_spread":0.2288412987863944,"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."}}