The Caloric-Restricted Diet Problem (CRDP) aims at finding diets with a reduced caloric count that also respects the nutritional needs of an individual. Thus, it is possible to achieve weight loss without compromising the individual's health. However, due to the small amount of energy contained in such diets, one may not be fully satisfied after a meal. It is possible to overcome this drawback by inserting a larger amount of protein in the diet, as it was shown to be the most effective macronutrient that provides satiety. Thus, this work presents a multi-objective mathematical formulation for the CRDP that minimizes the calorie count of the diet and maximizes the number of proteins ingested. Besides that, a Generalized Differential Evolution algorithm (GDE3) is proposed to solve the resulting problem. Computational experiments are performed with both mono-objective and multi-objective CRDP and two example diets are presented. It shows that it is possible to achieve a diet with a large amount of proteins, while restricting the caloric number.
