Consecutive Meals Planning by Using Permutation GA: Evaluation Function Proposal for Measuring Appearance Order of Meal’s Characteristics
The consecutive meals planning is a combinatorial optimization problem that determines a meals plan in one period consisting of consecutive days. This paper proposes an evaluation function using a moving entropy for this problem. The function measures the appearance order of meal’s characteristics on the plan. In the numerical experiments, we apply a permutation GA to the problem. We show that our meals plan is a good solution with large variation of appearance order of meal’s characteristics for the consecutive meals planning.
This work was supported by JSPS KAKENHI Grant Numbers #25750007 and #15K00339.
- 2.Darmon, N., Ferguson, E., Briend, A.: Linear and nonlinear programming to optimize the nutrient density of a population’s diet: an example based on diets of preschool children in rural Malawi. Am. J. Clin. Nutr. 75(2), 245–253 (2002)Google Scholar
- 3.Salookolayi, D.D., Yansari, A.T., Nasseri, S.H.: Application of fuzzy optimization in diet formulation. J. Math. Comput. Sci. 2(3), 459–468 (2011)Google Scholar
- 5.Kashima, T., Matsumoto, S., Ishii, H.: Evaluation of menu planning capability based on multi-dimensional 0/1 knapsack problem of nutritional management system. IAENG IJAM 39(3), IJAM_39_3_04 (2009)Google Scholar
- 6.Davis, L.: Applying adaptive algorithms to epistatic domains. In: 9th International Joint Conference on Artificial Intelligence, pp. 162–164. Morgan Kaufmann Publishers Inc., San Francisco (1985)Google Scholar