IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i21p15347-d1268398.html
   My bibliography  Save this article

A Multi-Objective Simulated Annealing Local Search Algorithm in Memetic CENSGA: Application to Vaccination Allocation for Influenza

Author

Listed:
  • Asma Khalil Alkhamis

    (College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

  • Manar Hosny

    (College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

Abstract

Flu vaccine allocation is of great importance for safeguarding public health and mitigating the impact of influenza outbreaks. In this regard, decision-makers face multifaceted challenges, including limited vaccine supply, targeting vulnerable people, adapting to regional variations, ensuring fairness in distribution, and promoting public trust. The objective of this work is to address the vaccination allocation problem by introducing a novel optimization scheme with the simulated annealing (SA) algorithm. A dual-objective model is developed to both manage infection rates and minimize the unit cost of the vaccination campaign. The proposed approach is designed to promote convergence toward the best Pareto front in multi-objective optimization, wherein SA attempts to embed diversity and uniformity within a memetic version of the controlled elitism nondominated sorting genetic algorithm (CENSGA). To model the underlying vaccination allocation problem, the dynamics of the disease are described using the susceptible–exposed–infectious–recovered (SEIR) epidemiological model to better express hidden flu characteristics. This model specifically analyzes the effects of pulsive vaccination allocation in two phases aiming to minimize the number of infected individuals to an acceptable level in a finite amount of time, which can help in stabilizing the model against sudden flu endemics over the long run. The computational experiments show that the proposed algorithm effectively explores the extensive search space of the vaccination allocation problem. The results of the suggested framework indicate that the obtained Pareto front best represents complete vaccination campaigns. The findings of this research can help in evidence-based decision making that can optimize flu vaccine distribution, contribute to the prevention of illness and reduction in hospitalizations, and potentially save countless lives.

Suggested Citation

  • Asma Khalil Alkhamis & Manar Hosny, 2023. "A Multi-Objective Simulated Annealing Local Search Algorithm in Memetic CENSGA: Application to Vaccination Allocation for Influenza," Sustainability, MDPI, vol. 15(21), pages 1-37, October.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:21:p:15347-:d:1268398
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/21/15347/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/21/15347/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    2. Khan, Asaf & Zaman, Gul, 2018. "Global analysis of an age-structured SEIR endemic model," Chaos, Solitons & Fractals, Elsevier, vol. 108(C), pages 154-165.
    3. Khalil Amine, 2019. "Multiobjective Simulated Annealing: Principles and Algorithm Variants," Advances in Operations Research, Hindawi, vol. 2019, pages 1-13, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anuraag Bukkuri & Joel S. Brown, 2021. "Evolutionary Game Theory: Darwinian Dynamics and the G Function Approach," Games, MDPI, vol. 12(4), pages 1-19, September.
    2. Felipe, Ángel & Ortuño, M. Teresa & Righini, Giovanni & Tirado, Gregorio, 2014. "A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 111-128.
    3. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
    4. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    5. Adeinat, Hamza & Pazhani, Subramanian & Mendoza, Abraham & Ventura, Jose A., 2022. "Coordination of pricing and inventory replenishment decisions in a supply chain with multiple geographically dispersed retailers," International Journal of Production Economics, Elsevier, vol. 248(C).
    6. Y Xu & R Qu, 2011. "Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 313-325, February.
    7. S.-C. Horng & S.-Y. Lin, 2009. "Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 213-231, February.
    8. Pavlos S. Georgilakis, 2020. "Review of Computational Intelligence Methods for Local Energy Markets at the Power Distribution Level to Facilitate the Integration of Distributed Energy Resources: State-of-the-art and Future Researc," Energies, MDPI, vol. 13(1), pages 1-37, January.
    9. Samer Hanoun & Asim Bhatti & Doug Creighton & Saeid Nahavandi & Phillip Crothers & Celeste Gloria Esparza, 2016. "Target coverage in camera networks for manufacturing workplaces," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1221-1235, December.
    10. Yaghoubi, Saeed & Noori, Siamak & Azaron, Amir & Fynes, Brian, 2015. "Resource allocation in multi-class dynamic PERT networks with finite capacity," European Journal of Operational Research, Elsevier, vol. 247(3), pages 879-894.
    11. M. De Beule & D. Van Den Poel & N. Van De Weghe, 2013. "An extended Huff-model for robustly benchmarking and predicting retail network performance," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 13/866, Ghent University, Faculty of Economics and Business Administration.
    12. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    13. Dimitrios Karpouzos & Konstantinos Katsifarakis, 2013. "A Set of New Benchmark Optimization Problems for Water Resources Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 27(9), pages 3333-3348, July.
    14. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    15. Máximo Méndez & Mariano Frutos & Fabio Miguel & Ricardo Aguasca-Colomo, 2020. "TOPSIS Decision on Approximate Pareto Fronts by Using Evolutionary Algorithms: Application to an Engineering Design Problem," Mathematics, MDPI, vol. 8(11), pages 1-27, November.
    16. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    17. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    18. Gülcü, Ayla & Akkan, Can, 2020. "Robust university course timetabling problem subject to single and multiple disruptions," European Journal of Operational Research, Elsevier, vol. 283(2), pages 630-646.
    19. Can Akkan & Ayla Gülcü & Zeki Kuş, 2022. "Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation," Journal of Scheduling, Springer, vol. 25(4), pages 477-501, August.
    20. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:21:p:15347-:d:1268398. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.