Solving SIS Epidemic Disease Model by Flower Pollination Algorithm

B. Sharma, Pooja Khurana, Deepak Kumar
{"title":"Solving SIS Epidemic Disease Model by Flower Pollination Algorithm","authors":"B. Sharma, Pooja Khurana, Deepak Kumar","doi":"10.1109/INDIACom51348.2021.00164","DOIUrl":null,"url":null,"abstract":"Mathematical sciences have continuously assisted many other interdisciplinary fields to find a solution to realworld problems. Intelligent and expert systems aim to imitate intelligent human experts to explain complex real-world problems of the real-world. An epidemic situation is an incidence of ailment that increases quickly and bothers numerous persons at the same time. The transmission of viruses is an immense drawback of the present era. In this work, SIS (Susceptible-Infected-Susceptible) ODE (Ordinary-differential-equation) model is taken into account and the graphs of the solution to these problems are compared with Euler's Method. Flower Pollination Algorithm (FPA) is a differential equation-based simple, adaptable, time-saving, and an exponentially better approach. It is a bio-inspired algorithm that simulates the real-life process of flower pollination.","PeriodicalId":415594,"journal":{"name":"2021 8th International Conference on Computing for Sustainable Global Development (INDIACom)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Computing for Sustainable Global Development (INDIACom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIACom51348.2021.00164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Mathematical sciences have continuously assisted many other interdisciplinary fields to find a solution to realworld problems. Intelligent and expert systems aim to imitate intelligent human experts to explain complex real-world problems of the real-world. An epidemic situation is an incidence of ailment that increases quickly and bothers numerous persons at the same time. The transmission of viruses is an immense drawback of the present era. In this work, SIS (Susceptible-Infected-Susceptible) ODE (Ordinary-differential-equation) model is taken into account and the graphs of the solution to these problems are compared with Euler's Method. Flower Pollination Algorithm (FPA) is a differential equation-based simple, adaptable, time-saving, and an exponentially better approach. It is a bio-inspired algorithm that simulates the real-life process of flower pollination.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用花授粉算法求解SIS疫病模型
数学科学不断地帮助许多其他跨学科领域找到解决现实世界问题的方法。智能和专家系统旨在模仿智能的人类专家来解释现实世界的复杂问题。流行病是一种发病率迅速增加并同时困扰许多人的疾病。病毒的传播是当今时代的一大缺点。本文考虑了SIS(易感-感染-易感)ODE(常微分方程)模型,并与欧拉方法的解图进行了比较。花授粉算法(FPA)是一种基于微分方程的简单、适应性强、省时、指数更好的方法。这是一种仿生算法,模拟了现实生活中的授粉过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Stochastic Scheduling of Parking Lot Operator in Energy and Regulation Markets amalgamating PBDR Social Synchrony: An Analytical Contemplation of Contemporary State of Art Frameworks The AI enabled Chatbot Framework for Intelligent Citizen-Government Interaction for Delivery of Services Biometric System - Challenges and Future Trends Solving SIS Epidemic Disease Model by Flower Pollination Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1