Solving Dietary Planning Problem using Particle Swarm Optimization with Genetic Operators

Edmarlyn Porras, Arnel C. Fajardo, Ruji P. Medina
{"title":"Solving Dietary Planning Problem using Particle Swarm Optimization with Genetic Operators","authors":"Edmarlyn Porras, Arnel C. Fajardo, Ruji P. Medina","doi":"10.1145/3310986.3311005","DOIUrl":null,"url":null,"abstract":"Dietary planning problem is considered as Multi-dimensional Knapsack Problem and confirmed to be a NP-hard problem. There are different ways on how to generate a dietary plan and it includes different constraints such as having a variety of foods, meeting the required total calories, satisfying different nutrients and others. Particle swarm optimization is a promising method to solve different kinds of optimization problem due to its fast convergence, few parameters needed and ability to find good solutions to the problem. PSO using constriction coefficient method was applied in this study and genetic operators were integrated to explore the search space and improved the quality of the solution. Experimental results show that the proposed algorithm was able to generate a varied diet plans for adults wherein it satisfies the specified constraints and PSO with genetic operators was able to evolve better solutions compare to original PSO.","PeriodicalId":252781,"journal":{"name":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3310986.3311005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Dietary planning problem is considered as Multi-dimensional Knapsack Problem and confirmed to be a NP-hard problem. There are different ways on how to generate a dietary plan and it includes different constraints such as having a variety of foods, meeting the required total calories, satisfying different nutrients and others. Particle swarm optimization is a promising method to solve different kinds of optimization problem due to its fast convergence, few parameters needed and ability to find good solutions to the problem. PSO using constriction coefficient method was applied in this study and genetic operators were integrated to explore the search space and improved the quality of the solution. Experimental results show that the proposed algorithm was able to generate a varied diet plans for adults wherein it satisfies the specified constraints and PSO with genetic operators was able to evolve better solutions compare to original PSO.
基于遗传算子的粒子群算法求解膳食规划问题
饮食计划问题被认为是多维背包问题,并被确认为np困难问题。如何制定饮食计划有不同的方法,它包括不同的限制,如有各种各样的食物,满足所需的总热量,满足不同的营养和其他。粒子群算法具有收敛速度快、所需参数少、能找到较好的解等优点,是求解各种优化问题的一种很有前途的方法。本研究采用收缩系数法的粒子群算法,结合遗传算子探索搜索空间,提高解的质量。实验结果表明,该算法能够生成满足指定约束条件的多种成人饮食计划,具有遗传算子的粒子群算法能够进化出比原粒子群算法更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信