Ling Tong
ABSTRACT
This article introduces the application of the simulated annealing algorithm (SA) in solving brand promotion problems. The goal of the brand promotion problem is to find a path that minimizes the distance through all cities. We use the SA algorithm to solve the brand promotion problem, which avoids the trap of local optimal solutions by using a randomized search strategy and an acceptance of inferior solutions strategy. In this article, we apply the SA algorithm to a brand promotion problem instance and compare it with genetic algorithms and greedy algorithms. The experimental results show that the SA algorithm can obtain results close to the optimal solution and has better robustness and faster convergence speed.
- Melović, B., Jocović, M., Dabić, M., Vulić, T. B., & Dudic, B. (2020). The impact of digital transformation and digital marketing on the brand promotion, positioning and electronic business in Montenegro. Technology in Society, 63, 101425.Google Scholar
Cross Ref
- Abbas, U., Islam, K. A., Hussain, S., Baqir, M., & Muhammad, N. (2021). Impact of brand image on customer loyalty with the mediating role of customer satisfaction and brand awareness. International Journal of Marketing Research Innovation, 5(1), 1-15.Google ScholarCross Ref
- Gupta, S., Gallear, D., Rudd, J., & Foroudi, P. (2020). The impact of brand value on brand competitiveness. Journal of Business Research, 112, 210-222.Google ScholarCross Ref
- Tien, N. H., Dung, H. T., & Tien, N. V. (2019). Branding building for Vietnam tourism industry reality and solutions. International Journal of Research in Marketing Management and Sales, 1(2), 63-68.Google Scholar
- Tajpour, M., Hosseini, E., Mohammadi, M., & Bahman-Zangi, B. (2022). The effect of knowledge management on the sustainability of technology-driven businesses in emerging markets: The mediating role of social media. Sustainability, 14(14), 8602.Google ScholarCross Ref
- Farooq, Q., Fu, P., Hao, Y., Jonathan, T., & Zhang, Y. (2019). A review of management and importance of e-commerce implementation in service delivery of private express enterprises of China. Sage Open, 9(1), 2158244018824194.Google ScholarCross Ref
- Ngarmwongnoi, C., Oliveira, J. S., AbedRabbo, M., & Mousavi, S. (2020). The implications of eWOM adoption on the customer journey. Journal of Consumer Marketing, 37(7), 749-759.Google ScholarCross Ref
- Delahaye, D., Chaimatanan, S., & Mongeau, M. (2019). Simulated annealing: From basics to applications. Handbook of metaheuristics, 1-35.Google Scholar
- Kirkpatrick, S., Gelatt Jr, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. science, 220(4598), 671-680.Google Scholar
- Masoud, M., Elhenawy, M., Liu, S. Q., Almannaa, M., Glaser, S., & Alhajyaseen, W. (2023). A Simulated Annealing for Optimizing Assignment of E-Scooters to Freelance Chargers. Sustainability, 15(3), 1869.Google Scholar
- Liu, Y., Heidari, A. A., Cai, Z., Liang, G., Chen, H., Pan, Z., ... & Bourouis, S. (2022). Simulated annealing-based dynamic step shuffled frog leaping algorithm: Optimal performance design and feature selection. Neurocomputing, 503, 325-362.Google ScholarDigital Library
- Ma, D., & Duan, Q. (2022). A hybrid-strategy-improved butterfly optimization algorithm applied to the node coverage problem of wireless sensor networks. Mathematical Biosciences and Engineering, 19(4), 3928-3952.Google Scholar
- Amine, K. (2019). Multiobjective simulated annealing: Principles and algorithm variants. Advances in Operations Research, 2019.Google Scholar
- Tayal, A., & Singh, S. P. (2019). Analysis of simulated annealing cooling schemas for design of optimal flexible layout under uncertain dynamic product demand. International Journal of Operational Research, 34(1), 85-103.Google Scholar
- Kavitha, A., & Velusamy, R. L. (2020). Simulated annealing and genetic algorithm-based hybrid approach for energy-aware clustered routing in large-range multi-sink wireless sensor networks. International Journal of Ad Hoc and Ubiquitous Computing, 35(2), 96-116.Google Scholar
- Zhao, Z., Zhou, M., & Liu, S. (2021). Iterated greedy algorithms for flow-shop scheduling problems: A tutorial. IEEE Transactions on Automation Science and Engineering.Google Scholar
- Han, X., Han, Y., Zhang, B., Qin, H., Li, J., Liu, Y., & Gong, D. (2022). An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion. Applied Soft Computing, 129, 109502.Google Scholar
- Lambora, A., Gupta, K., & Chopra, K. (2019, February). Genetic algorithm-A literature review. In 2019 international conference on machine learning, big data, cloud and parallel computing (COMITCon) (pp. 380-384). IEEE.Google Scholar
- Deng, W., Zhang, X., Zhou, Y., Liu, Y., Zhou, X., Chen, H., & Zhao, H. (2022). An enhanced fast non-dominated solution sorting genetic algorithm for multi-objective problems. Information Sciences, 585, 441-453.Google Scholar
Recommendations
Note. Optimal Promotion Strategies: A Demand-Sided Characterization
We generalize Narasimhan's Narasimhan, Chakravarthi. 1988. Competitive promotional strategies. J. Bus.614 427-449. model of retail promotion to include multiple products and general demand functions. Doing so allows us to further characterize optimal ...
Optimal Advertising and Promotion Budgets in Dynamic Markets with Brand Equity as a Mediating Variable
We study the optimal levels of advertising and promotion budgets in dynamic markets with brand equity as a mediating variable. To this end, we develop and estimate a state-space model based on the Kalman filter that captures the dynamics of brand equity ...
Asymmetric Promotion Effects and Brand Positioning
Several studies have shown that promotions of national brands yield more effect than those of store brands e.g., Allenby and Rossi 1991, Blattberg and Wisniewski 1989. However, the evolution of price-quality data available from Consumer Reports over the ...
Comments