期刊名称:Journal of Advances in Information Technology
印刷版ISSN:1798-2340
出版年度:2018
卷号:9
期号:3
页码:51-56
DOI:10.12720/jait.9.3.51-56
出版社:Academy Publisher
摘要:The consecutive meals planning is a planning problem that determines a meals plan on a long period consisting of consecutive days. A meal has a variety of characteristics such as food style, ingredient, and cooking method. Therefore, it is desired that the consecutive meals plan provides a variation of appearance order of meal's characteristics. This paper optimizes such a variation of appearance order on a long period by using a permutation GA and analyzes the meal's characteristics in the optimum solution. In the numerical experiments, we show that the optimum solution obtained by permutation GA has high quality and is effective for the consecutive meals planning with large variation of appearance order of meal's characteristics.