Multi-Constraint Particle Swarm Optimization Algorithm in Diet Recommendation for Indian Elderly Persons

被引:1
|
作者
Gautam, Leena K. [1 ]
Gulhane, Vijay S. [1 ]
机构
[1] Sipna Coll Engn & Technol, Dept Informat Technol, Amravati, Maharashtra, India
来源
PROCEEDINGS OF THE 2021 FIFTH INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC 2021) | 2021年
关键词
D O I
10.1109/I-SMAC52330.2021.9640893
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A meal recommendation plan should include varieties of food from different categories, and a proper balance of all the nutrients in a required amount. This is a combinatorial optimization problem and is NP-hard. To address NP-hard optimization problems, metaheuristic algorithms having good exploration and exploitation properties are used. This paper proposes a Multi Constraint Particle Swarm Optimization algorithm for meal recommendations for Indian elderly persons. The method adapted easily works with traditional PSO without extra computation cost. It evaluates fitness function based on various nutrient constraints from different categories. Moreover, to improve the particles' searching efficiency and to improve the quality of the solution, initialization of position and velocity of particles are done randomly from a customized set that includes personalised data obtained during registration.Experiments at an initial level were also conducted, showing positive results.
引用
收藏
页码:1018 / 1022
页数:5
相关论文
共 50 条
  • [31] MIMOSA: Multi-constraint Molecule Sampling for Molecule Optimization
    Fu, Tianfan
    Xiao, Cao
    Li, Xinhao
    Glass, Lucas
    Sun, Jimeng
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 125 - 133
  • [32] Multi-constraint and multi-objective optimization of free-form reticulated shells using improved optimization algorithm
    Cao, Zhenggang
    Wang, Zhicheng
    Zhao, Lin
    Fan, Feng
    Sun, Ying
    ENGINEERING STRUCTURES, 2022, 250
  • [33] A Personalized Recommendation Algorithm Based on Weighted Information Entropy and Particle Swarm Optimization
    Jiang, Shuhao
    Ding, Jincheng
    Zhang, Liyi
    MOBILE INFORMATION SYSTEMS, 2021, 2021
  • [34] Intelligent recommendation algorithm for social networks based on gradient particle swarm optimization
    Liu Xiao-Li
    2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [35] A Multi-Swarm Particle Swarm Optimization Algorithm for Tracking Multiple Targets
    Zheng, Hui
    Jie, Jing
    Hou, Beiping
    Fei, Zhengshun
    PROCEEDINGS OF THE 2014 9TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2014, : 1662 - 1665
  • [36] Discrete Particle Swarm Optimization Algorithm for Dynamic Constraint Satisfaction with Minimal Perturbation
    Bidar, Mahdi
    Mouhoub, Malek
    2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 4353 - 4360
  • [37] Test Scheduling of SOC with Power Constraint Based on Particle Swarm Optimization Algorithm
    Xu Chuan-pei
    Hu Hong-bo
    Niu Jun-hao
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 611 - 614
  • [38] Combined Quantum Particle Swarm Optimization Algorithm for Multi-objective Nutritional Diet Decision Making
    Lv, Youbo
    2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 4, 2009, : 279 - 282
  • [39] A Particle Swarm with Local Decision Algorithm for Functional Distributed Constraint Optimization Problems
    Shi, Meifeng
    Liao, Xin
    Chen, Yuan
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2022, 36 (12)
  • [40] A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization
    Yazdani, Danial
    Nasiri, Babak
    Sepas-Moghaddam, Alireza
    Meybodi, Mohammad Reza
    APPLIED SOFT COMPUTING, 2013, 13 (04) : 2144 - 2158