{"id":"W425598545","doi":"","title":"Optimal Advertising Campaign Generation For Multiple Brands Using Multi-Objective Genetic Algorithm","year":2005,"lang":"en","type":"article","venue":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Greedy algorithm; Genetic algorithm; Mathematical optimization; Heuristic; Computer science; Variety (cybernetics); Pareto optimal; Set (abstract data type); Encoding (memory); Key (lock); Optimization problem; Pareto principle; Algorithm; Multi-objective optimization; Greedy randomized adaptive search procedure; Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008064318,0.0002794855,0.000549604,0.0007929319,0.001531763,0.00002584534,0.002091455,0.0002919748,0.00009765101],"category_scores_gemma":[0.0001098316,0.0003622709,0.0003623096,0.001313427,0.00121567,0.001165456,0.001058515,0.0005596445,0.000005871944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004865786,"about_ca_system_score_gemma":0.0004878687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002602918,"about_ca_topic_score_gemma":0.002357084,"domain_scores_codex":[0.9971728,0.0004756881,0.000241592,0.0007447904,0.0007643091,0.0006008749],"domain_scores_gemma":[0.9962595,0.0005364839,0.0004522682,0.0007725145,0.001744848,0.0002344284],"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.0008644995,0.001502415,0.001158246,0.0001570049,0.0005178371,0.00008032731,0.04297659,0.8293374,0.01306199,0.000332046,0.0005992042,0.1094125],"study_design_scores_gemma":[0.004490467,0.0003455772,0.002365479,0.000104171,0.00009588138,0.00001254696,0.02860621,0.9607597,0.000811365,0.00001788481,0.002058279,0.0003324368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0917247,0.0001712865,0.9060938,0.0007269523,0.00008008356,0.0008040734,0.0002138586,0.00006927963,0.0001160122],"genre_scores_gemma":[0.2166308,0.0003435524,0.7815539,0.00001280035,0.00006140392,3.316804e-8,0.00004364618,0.00001708891,0.001336731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1314223,"threshold_uncertainty_score":0.9998829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05859566639916588,"score_gpt":0.288876448686293,"score_spread":0.2302807822871271,"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."}}