An extension of menu planning algorithm for two-phase homemade cooking

N. Funabiki, Y. Matsushima, T. Nakanishi, Kan Watanabe
{"title":"An extension of menu planning algorithm for two-phase homemade cooking","authors":"N. Funabiki, Y. Matsushima, T. Nakanishi, Kan Watanabe","doi":"10.1109/GCCE.2013.6664853","DOIUrl":null,"url":null,"abstract":"Nowadays, many people keep busy lives due to working in companies, studying in schools, or taking care of children or senior parents. As a result, it has become very hard for them to cook foods for suppers by themselves at home after long-hour duties at daytime in weekdays. Previously, to assist homemade cooking of such busy people, we proposed a two-phase cooking such that the preparation phase of cooking foods that they will eat on the following weekdays is performed on a weekend, and the finishing phase for the foods for a supper is completed on the day in short time. Then, we presented a menu planning algorithm to assist generating one-week menus for this two-phase cooking. Unfortunately, we found that this algorithm has the following drawbacks in practical use: 1) the selection of food preference is not easy, 2) the use of preferred ingredients for cooking cannot be directly specified, and 3) the nutrition balance of foods in a menu is not considered. In this paper, we extend this algorithm to solve them by newly defining a preference index and the food balance guide by Japanese government. We verify the effectiveness of the extended algorithm through generating five-day menus from 241 food candidates.","PeriodicalId":294532,"journal":{"name":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCCE.2013.6664853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nowadays, many people keep busy lives due to working in companies, studying in schools, or taking care of children or senior parents. As a result, it has become very hard for them to cook foods for suppers by themselves at home after long-hour duties at daytime in weekdays. Previously, to assist homemade cooking of such busy people, we proposed a two-phase cooking such that the preparation phase of cooking foods that they will eat on the following weekdays is performed on a weekend, and the finishing phase for the foods for a supper is completed on the day in short time. Then, we presented a menu planning algorithm to assist generating one-week menus for this two-phase cooking. Unfortunately, we found that this algorithm has the following drawbacks in practical use: 1) the selection of food preference is not easy, 2) the use of preferred ingredients for cooking cannot be directly specified, and 3) the nutrition balance of foods in a menu is not considered. In this paper, we extend this algorithm to solve them by newly defining a preference index and the food balance guide by Japanese government. We verify the effectiveness of the extended algorithm through generating five-day menus from 241 food candidates.
两阶段自制烹饪菜单规划算法的扩展
如今,由于在公司工作,在学校学习,或照顾孩子或年迈的父母,许多人保持忙碌的生活。因此,在工作日白天长时间的工作之后,他们很难在家里自己做饭。在此之前,为了帮助这些忙碌的人自己做饭,我们提出了两阶段的烹饪方法,在周末完成他们接下来工作日要吃的烹饪食物的准备阶段,在短时间内完成晚餐食物的整理阶段。然后,我们提出了一种菜单规划算法,以帮助为这种两阶段烹饪生成一周的菜单。不幸的是,我们发现该算法在实际使用中存在以下缺点:1)食物偏好的选择不容易,2)烹饪时首选的食材不能直接指定,3)没有考虑菜单中食物的营养平衡。在本文中,我们通过重新定义偏好指数和日本政府的食物平衡指南来扩展该算法来解决这些问题。我们通过从241种候选食物中生成五天菜单来验证扩展算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信