{"id":"https://openalex.org/W4382046214","doi":"https://doi.org/10.1145/3598438.3598440","title":"Study of optimal site selection for brand promotion based on simulated annealing and genetic algorithms","display_name":"Study of optimal site selection for brand promotion based on simulated annealing and genetic algorithms","publication_year":2022,"publication_date":"2022-12-09","ids":{"openalex":"https://openalex.org/W4382046214","doi":"https://doi.org/10.1145/3598438.3598440"},"language":"en","primary_location":{"id":"doi:10.1145/3598438.3598440","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3598438.3598440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 3rd International Symposium on Big Data and Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103147567","display_name":"Ling Tong","orcid":"https://orcid.org/0009-0008-9850-2581"},"institutions":[{"id":"https://openalex.org/I257545875","display_name":"Hunan University of Humanities, Science and Technology","ror":"https://ror.org/00s7jmd98","country_code":"CN","type":"education","lineage":["https://openalex.org/I257545875"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ling Tong","raw_affiliation_strings":["Hunan University of Humanities, Science and Technology, China"],"raw_orcid":"https://orcid.org/0009-0008-9850-2581","affiliations":[{"raw_affiliation_string":"Hunan University of Humanities, Science and Technology, China","institution_ids":["https://openalex.org/I257545875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103147567"],"corresponding_institution_ids":["https://openalex.org/I257545875"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25825847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"10","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10609","display_name":"Digital Marketing and Social Media","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/simulated-annealing","display_name":"Simulated annealing","score":0.7245745658874512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6483156681060791},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6394208073616028},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5737726092338562},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5643510222434998},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.5412660837173462},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5411410331726074},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5405584573745728},{"id":"https://openalex.org/keywords/promotion","display_name":"Promotion (chess)","score":0.5390649437904358},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4657614529132843},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.26780593395233154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24697718024253845}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7245745658874512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6483156681060791},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6394208073616028},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5737726092338562},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5643510222434998},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.5412660837173462},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5411410331726074},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5405584573745728},{"id":"https://openalex.org/C98147612","wikidata":"https://www.wikidata.org/wiki/Q215599","display_name":"Promotion (chess)","level":3,"score":0.5390649437904358},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4657614529132843},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.26780593395233154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24697718024253845},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3598438.3598440","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3598438.3598440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 3rd International Symposium on Big Data and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2903359179","https://openalex.org/W2908801759","https://openalex.org/W2944850467","https://openalex.org/W3005540701","https://openalex.org/W3037217177","https://openalex.org/W3086123316","https://openalex.org/W3092643736","https://openalex.org/W3131951465","https://openalex.org/W3137007432","https://openalex.org/W3217374538","https://openalex.org/W4211108649","https://openalex.org/W4283687612","https://openalex.org/W4285597298","https://openalex.org/W4296004260","https://openalex.org/W4317423306","https://openalex.org/W4383031528","https://openalex.org/W6754582864","https://openalex.org/W6768604410"],"related_works":["https://openalex.org/W2077092686","https://openalex.org/W2261837478","https://openalex.org/W3007136692","https://openalex.org/W1967687468","https://openalex.org/W2089397391","https://openalex.org/W2002077985","https://openalex.org/W173512906","https://openalex.org/W2382432451","https://openalex.org/W2394090522","https://openalex.org/W2979021254"],"abstract_inverted_index":{"This":[0],"article":[1],"introduces":[2],"the":[3,6,19,30,37,42,48,72,95,103],"application":[4],"of":[5,18,50,63],"simulated":[7],"annealing":[8],"algorithm":[9,39,74,97],"(SA)":[10],"in":[11],"solving":[12],"brand":[13,20,43,77],"promotion":[14,21,44,78],"problems.":[15],"The":[16,90],"goal":[17],"problem":[22,79],"is":[23],"to":[24,40,75,102],"find":[25],"a":[26,56,76],"path":[27],"that":[28,94],"minimizes":[29],"distance":[31],"through":[32],"all":[33],"cities.":[34],"We":[35],"use":[36],"SA":[38,73,96],"solve":[41],"problem,":[45],"which":[46],"avoids":[47],"trap":[49],"local":[51],"optimal":[52,104],"solutions":[53,65],"by":[54],"using":[55],"randomized":[57],"search":[58],"strategy":[59],"and":[60,81,87,106,110],"an":[61],"acceptance":[62],"inferior":[64],"strategy.":[66],"In":[67],"this":[68],"article,":[69],"we":[70],"apply":[71],"instance":[80],"compare":[82],"it":[83],"with":[84],"genetic":[85],"algorithms":[86],"greedy":[88],"algorithms.":[89],"experimental":[91],"results":[92,100],"show":[93],"can":[98],"obtain":[99],"close":[101],"solution":[105],"has":[107],"better":[108],"robustness":[109],"faster":[111],"convergence":[112],"speed.":[113]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}