{"id":"https://openalex.org/W4229003265","doi":"https://doi.org/10.1145/3477314.3507320","title":"A new reference-based algorithm based on non-euclidean geometry for multi-stakeholder media planning","display_name":"A new reference-based algorithm based on non-euclidean geometry for multi-stakeholder media planning","publication_year":2022,"publication_date":"2022-04-25","ids":{"openalex":"https://openalex.org/W4229003265","doi":"https://doi.org/10.1145/3477314.3507320"},"language":"en","primary_location":{"id":"doi:10.1145/3477314.3507320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3477314.3507320","pdf_url":null,"source":{"id":"https://openalex.org/S4363608665","display_name":"Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03692704","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039256210","display_name":"Fodil Benali","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fodil Benali","raw_affiliation_strings":["Adwanted Group, Paris, France","AdWanted"],"affiliations":[{"raw_affiliation_string":"Adwanted Group, Paris, France","institution_ids":[]},{"raw_affiliation_string":"AdWanted","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032205030","display_name":"Damien Bod\u00e9n\u00e8s","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Damien Bod\u00e9n\u00e8s","raw_affiliation_strings":["Adwanted Group, Paris, France","AdWanted"],"affiliations":[{"raw_affiliation_string":"Adwanted Group, Paris, France","institution_ids":[]},{"raw_affiliation_string":"AdWanted","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032407315","display_name":"Cyril de Runz","orcid":"https://orcid.org/0000-0002-5951-6859"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril de Runz","raw_affiliation_strings":["University of Tours, Blois, France"],"affiliations":[{"raw_affiliation_string":"University of Tours, Blois, France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030548615","display_name":"Nicolas Labroche","orcid":"https://orcid.org/0000-0002-2794-2124"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Labroche","raw_affiliation_strings":["University of Tours, Blois, France"],"affiliations":[{"raw_affiliation_string":"University of Tours, Blois, France","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039256210"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5188,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49917492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1056","last_page":"1065"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6802047491073608},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6621785163879395},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.62229323387146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5936331748962402},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5446873903274536},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.45764559507369995},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4470415711402893},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4215085804462433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35702353715896606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3436594009399414},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15432319045066833}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6802047491073608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6621785163879395},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.62229323387146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5936331748962402},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5446873903274536},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.45764559507369995},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4470415711402893},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4215085804462433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35702353715896606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3436594009399414},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15432319045066833},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3477314.3507320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3477314.3507320","pdf_url":null,"source":{"id":"https://openalex.org/S4363608665","display_name":"Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03692704v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03692704","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Apr 2022, Virtual Event, United States. pp.1056-1065, ⟨10.1145/3477314.3507320⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03692704v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03692704","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Apr 2022, Virtual Event, United States. pp.1056-1065, ⟨10.1145/3477314.3507320⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1808460590","https://openalex.org/W1846834309","https://openalex.org/W1980729457","https://openalex.org/W1984851270","https://openalex.org/W1988928876","https://openalex.org/W2001772548","https://openalex.org/W2022485595","https://openalex.org/W2039503854","https://openalex.org/W2042947003","https://openalex.org/W2068484625","https://openalex.org/W2085507535","https://openalex.org/W2098907614","https://openalex.org/W2110828487","https://openalex.org/W2126105956","https://openalex.org/W2139279076","https://openalex.org/W2143381319","https://openalex.org/W2166674691","https://openalex.org/W2502797727","https://openalex.org/W2607407907","https://openalex.org/W2912472836","https://openalex.org/W2943403630","https://openalex.org/W2946725000","https://openalex.org/W2953831633","https://openalex.org/W3021613070","https://openalex.org/W3094394390"],"related_works":["https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W14679004","https://openalex.org/W1566651525","https://openalex.org/W2977652649","https://openalex.org/W2318206461","https://openalex.org/W37157938","https://openalex.org/W2105228010"],"abstract_inverted_index":{"This":[0],"paper":[1],"tackles":[2],"the":[3,50,56,91,99,104,110,120,129,142,160,174,179,204],"Campaign":[4],"Allocation":[5],"Problem":[6],"of":[7,49,61,78,88,122,133,138,159,182,197],"commercial":[8],"Ads":[9],"in":[10,86,131,141,195],"TV":[11],"breaks.":[12],"The":[13,36],"problem":[14,25],"is":[15],"NP-Hard":[16],"and":[17,33,94,151,201,212,217],"can":[18],"be":[19,40,70,128,153],"viewed":[20],"as":[21,107],"a":[22,71,113,136,147,156,167],"multi-stakeholders":[23],"multiobjective":[24],"with":[26,178],"highly":[27],"competing":[28],"objectives":[29],"for":[30,74,135,221],"different":[31],"brands":[32],"numerous":[34],"constraints.":[35],"expected":[37],"solutions":[38],"should":[39],"able":[41],"to":[42,55,98,127,155],"focus":[43],"on,":[44],"at":[45],"least,":[46],"one":[47],"sub-part":[48],"Pareto":[51,161],"Optimal":[52],"Front":[53],"according":[54],"decision":[57],"maker's":[58],"(DM)":[59],"region":[60],"interest.":[62],"Consequently,":[63],"reference":[64,92,183,205],"point-based":[65],"many":[66],"objective":[67,105],"approaches":[68,82],"could":[69],"good":[72],"option":[73],"solving":[75],"this":[76,190],"kind":[77],"problems.":[79],"However,":[80],"such":[81],"suffer":[83],"from":[84],"limitations":[85],"terms":[87,132,196],"diversity":[89,134,176,200],"around":[90,203],"points,":[93],"other":[95],"issues":[96],"due":[97],"fact":[100],"that":[101,172,189],"they":[102],"consider":[103],"space":[106],"Euclidean.":[108],"For":[109,163],"latter,":[111],"recently":[112],"new":[114],"algorithm":[115],"called":[116,170],"AGE-MOEA,":[117],"by":[118],"removing":[119],"assumption":[121],"Euclidean":[123],"spaces,":[124],"has":[125,146],"proven":[126],"best":[130],"lot":[137],"many-objective":[139],"problems":[140],"literature.":[143],"Nevertheless,":[144],"AGE-MOEA":[145,175],"high":[148],"computational":[149],"complexity":[150],"cannot":[152],"driven":[154],"specific":[157],"sub-parts":[158],"Front.":[162],"that,":[164],"we":[165],"propose":[166],"novel":[168],"approach,":[169],"RAGE-MOEA,":[171],"combines":[173],"principles":[177],"convergence":[180,202],"elements":[181],"based":[184],"approaches.":[185],"Experiments":[186],"have":[187],"shown":[188],"approach":[191],"obtains":[192],"better":[193,219],"results":[194,220],"compromise":[198],"between":[199],"points":[206],"than":[207],"usual":[208],"Reference-based":[209],"methods":[210],"(R-NSGA-II":[211],"R-NSGA-III)":[213],"on":[214],"literature":[215],"benchmarks,":[216],"significantly":[218],"our":[222],"industrial":[223],"problem.":[224]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}