一种解决菜单规划问题的进化单目标方法

R. P. C. Moreira, E. Wanner, F. V. Martins, J. Sarubbi
{"title":"一种解决菜单规划问题的进化单目标方法","authors":"R. P. C. Moreira, E. Wanner, F. V. Martins, J. Sarubbi","doi":"10.1109/CEC.2018.8477888","DOIUrl":null,"url":null,"abstract":"This work proposes an evolutionary approach to solve the Menu Planning Problem. Our work uses the Brazilian school context and our principal goal is to create menus that minimize the total cost of these menus. However, those menus must also satisfy requirements of the Brazilian government, such as: (i) student age group, (ii) school category, (iii) school duration time, (iv) school location, (v) variety of preparations, (vi) harmony of preparations, (vii) maximum amount to be paid for each meal and, (viii) lower and upper limits of macronutrients. The results demonstrate that the evolutionary approach is not only able to generate a set of inexpensive and healthy menus but also respect the required set of constraints. A constrained deterministic approach is performed to generate 5-day menu through a greedy-based function taking into account the normalized sum of all macronutrients and the monetary cost of the menu. A comparison between the 5-day menu obtained by the proposed approach and the constrained greedy-based approach menu is carried out. Despite the fact the obtained menu outperforms the greed-based menu taking into account the total cost, this difference is not so expressive. However, all macronutrients were outside the pre-defined range at least in one day of the week. The 5-day menu obtained by the proposed approach is evaluated by a nutritionist. The overall quality of the menu is outstanding and the time spent to generate it is 60 seconds.","PeriodicalId":212677,"journal":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Evolutionary Mono-Objective Approach for Solving the Menu Planning Problem\",\"authors\":\"R. P. C. Moreira, E. Wanner, F. V. Martins, J. Sarubbi\",\"doi\":\"10.1109/CEC.2018.8477888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work proposes an evolutionary approach to solve the Menu Planning Problem. Our work uses the Brazilian school context and our principal goal is to create menus that minimize the total cost of these menus. However, those menus must also satisfy requirements of the Brazilian government, such as: (i) student age group, (ii) school category, (iii) school duration time, (iv) school location, (v) variety of preparations, (vi) harmony of preparations, (vii) maximum amount to be paid for each meal and, (viii) lower and upper limits of macronutrients. The results demonstrate that the evolutionary approach is not only able to generate a set of inexpensive and healthy menus but also respect the required set of constraints. A constrained deterministic approach is performed to generate 5-day menu through a greedy-based function taking into account the normalized sum of all macronutrients and the monetary cost of the menu. A comparison between the 5-day menu obtained by the proposed approach and the constrained greedy-based approach menu is carried out. Despite the fact the obtained menu outperforms the greed-based menu taking into account the total cost, this difference is not so expressive. However, all macronutrients were outside the pre-defined range at least in one day of the week. The 5-day menu obtained by the proposed approach is evaluated by a nutritionist. The overall quality of the menu is outstanding and the time spent to generate it is 60 seconds.\",\"PeriodicalId\":212677,\"journal\":{\"name\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2018.8477888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

这项工作提出了一种进化的方法来解决菜单规划问题。我们的工作使用了巴西的学校环境,我们的主要目标是创建菜单,使这些菜单的总成本最小化。但是,这些菜单还必须满足巴西政府的要求,例如:(i)学生年龄组,(ii)学校类别,(iii)学校持续时间,(iv)学校位置,(v)准备的种类,(vi)准备的协调性,(vii)每餐支付的最高金额,以及(viii)常量营养素的下限和上限。结果表明,进化方法不仅能够生成一组廉价和健康的菜单,而且还尊重所需的一组约束。考虑到所有常量营养素的标准化总和和菜单的货币成本,通过基于贪婪的函数执行约束确定性方法来生成5天菜单。将该方法获得的5天菜单与基于约束贪婪的方法菜单进行了比较。尽管考虑到总成本,获得的菜单优于基于贪婪的菜单,但这种差异并不那么明显。然而,在一周中至少有一天,所有的常量营养素都超出了预定的范围。由建议的方法获得的5天菜单由营养学家进行评估。菜单的整体质量非常出色,制作时间为60秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Evolutionary Mono-Objective Approach for Solving the Menu Planning Problem
This work proposes an evolutionary approach to solve the Menu Planning Problem. Our work uses the Brazilian school context and our principal goal is to create menus that minimize the total cost of these menus. However, those menus must also satisfy requirements of the Brazilian government, such as: (i) student age group, (ii) school category, (iii) school duration time, (iv) school location, (v) variety of preparations, (vi) harmony of preparations, (vii) maximum amount to be paid for each meal and, (viii) lower and upper limits of macronutrients. The results demonstrate that the evolutionary approach is not only able to generate a set of inexpensive and healthy menus but also respect the required set of constraints. A constrained deterministic approach is performed to generate 5-day menu through a greedy-based function taking into account the normalized sum of all macronutrients and the monetary cost of the menu. A comparison between the 5-day menu obtained by the proposed approach and the constrained greedy-based approach menu is carried out. Despite the fact the obtained menu outperforms the greed-based menu taking into account the total cost, this difference is not so expressive. However, all macronutrients were outside the pre-defined range at least in one day of the week. The 5-day menu obtained by the proposed approach is evaluated by a nutritionist. The overall quality of the menu is outstanding and the time spent to generate it is 60 seconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Evolution of AutoEncoders for Compressed Representations Landscape-Based Differential Evolution for Constrained Optimization Problems A Novel Approach for Optimizing Ensemble Components in Rainfall Prediction A Many-Objective Evolutionary Algorithm with Fast Clustering and Reference Point Redistribution Manyobjective Optimization to Design Physical Topology of Optical Networks with Undefined Node Locations
×
引用
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