{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008186654,0.000845917,0.0009516566,0.0009432866,0.0003997996,0.000777206,0.001133222,0.001105169,0.001521982],"category_scores_gemma":[0.001570103,0.0004403138,0.0009036225,0.0008789632,0.00052361,0.0006121671,0.0005767329,0.0007310431,0.0001812554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001102364,"about_ca_system_score_gemma":0.001259126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006641035,"about_ca_topic_score_gemma":0.005211326,"domain_scores_codex":[0.9996676,0.0001071801,0.00001304028,0.00007196188,0.00008653496,0.00005369538],"domain_scores_gemma":[0.9995103,0.0003196054,0.00005723071,0.00002458809,0.0000649646,0.00002334349],"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.00001861053,0.00002798788,0.0002924082,0.00001885332,0.00002125647,0.00002720245,0.00002406756,0.9721844,0.001019259,0.002545699,0.0002845449,0.02353564],"study_design_scores_gemma":[0.00001058115,0.0000162299,0.00006725906,0.000002839839,0.000007057289,0.000006957191,0.000005640815,0.9983969,0.0003282733,0.0008822752,0.0002728279,0.00000307315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06041728,0.0002434058,0.9343215,0.0001838349,0.00004161653,0.00009914603,0.00005346278,0.0003075764,0.004332225],"genre_scores_gemma":[0.4112985,0.0002322394,0.5839282,0.0001270098,0.00003214443,0.0003659117,0.0002180502,0.0000983477,0.003699625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006641035,"threshold_uncertainty_score":0.01320475,"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."}}