4.4 Article

An extensive search algorithm to find feasible healthy menus for humans.

期刊

OPERATIONAL RESEARCH
卷 22, 期 5, 页码 5231-5267

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s12351-022-00702-4

关键词

Multi-criteria programming; Heuristic integer programming; Algorithms; Menu planning problem; Inequality system

资金

  1. Universidad de Malaga/CBUA
  2. Spanish *Ministerio de Ciencia, Innovacion y Universidades *(MCIU/AEI/FEDER) [PID2019-104263RBC42]
  3. Junta de Andalucia [P18-RT-1566, CI-21-228, UMA18-FEDERJA-065]

向作者/读者索取更多资源

Promoting healthy lifestyles is a public priority, and designing nutritious and appealing diets is valuable. Menu Planning presents challenges, especially in finding a rich feasible region. This study developed a two-phase algorithm that quickly identifies solutions to the system and densifies the feasible region. The algorithm combines a metaheuristic with recombination to generate initial seeds and optimize the menus.
Promoting healthy lifestyles is nowadays a public priority among most public entities. The ability to design an array of nutritious and appealing diets is very valuable. Menu Planning still presents a challenge which complexity derives from the problems' many dimensions and the idiosyncrasies of human behavior towards eating. Among the difficulties encountered by researchers when facing the Menu Planning Problem, being able of finding a rich feasible region stands out. We consider it as a system of inequalities to which we try to find solutions. We have developed and implemented a two-phase algorithm -that mainly stems from the Randomized Search and the Genetic- that is capable of rapidly finding an pool of solutions to the system with the aim of properly identifying the feasible region of the underlying problem and proceed to its densification. It consists of a hybrid algorithm inspired on a GRASP metaheuristic and a later recombination. First, it generates initial seeds, identifying best candidates and guiding the search to create solutions to the system, thus attempting to verify every inequality. Afterwards, the recombination of different promising candidates helps in the densification of the feasible region with new solutions. This methodology is an adaptation of other previously used in literature, and that we apply to the MPP. For this, we generated a database of a 227 recipes and 272 ingredients. Applying this methodology to the database, we are able to obtain a pool of feasible (healthy and nutritious) complete menus for a given D number of days.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据