A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem
Encouraging healthy and balanced diet plans is one of the most important action points for governments around the world. Generating healthy, balanced and inexpensive menu plans that fulfil all the recommendations given by nutritionists is a complex and time-consuming task; because of this, computer...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/11/1960 |
| _version_ | 1827702834418679808 |
|---|---|
| author | Alejandro Marrero Eduardo Segredo Coromoto León Carlos Segura |
| author_facet | Alejandro Marrero Eduardo Segredo Coromoto León Carlos Segura |
| author_sort | Alejandro Marrero |
| collection | DOAJ |
| description | Encouraging healthy and balanced diet plans is one of the most important action points for governments around the world. Generating healthy, balanced and inexpensive menu plans that fulfil all the recommendations given by nutritionists is a complex and time-consuming task; because of this, computer science has an important role in this area. This paper deals with a novel constrained multi-objective formulation of the menu planning problem specially designed for school canteens that considers the minimisation of the cost and the minimisation of the level of repetition of the specific courses and food groups contained in the plans. Particularly, this paper proposes a multi-objective memetic approach based on the well-known multi-objective evolutionary algorithm based on decomposition (MOEA/D). A crossover operator specifically designed for this problem is included in the approach. Moreover, an ad-hoc iterated local search (ILS) is considered for the improvement phase. As a result, our proposal is referred to as ILS-MOEA/D. A wide experimental comparison against a recently proposed single-objective memetic scheme, which includes explicit mechanisms to promote diversity in the decision variable space, is provided. The experimental assessment shows that, even though the single-objective approach yields menu plans with lower costs, our multi-objective proposal offers menu plans with a significantly lower level of repetition of courses and food groups, with only a minor increase in cost. Furthermore, our studies demonstrate that the application of multi-objective optimisers can be used to implicitly promote diversity not only in the objective function space, but also in the decision variable space. Consequently, in contrast to the single-objective optimiser, there was no need to include an explicit strategy to manage the diversity in the decision space in the case of the multi-objective approach. |
| first_indexed | 2024-03-10T15:04:05Z |
| format | Article |
| id | doaj.art-70bc2aa722b54d62a28f3d42059b7a92 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-10T15:04:05Z |
| publishDate | 2020-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-70bc2aa722b54d62a28f3d42059b7a922023-11-20T19:53:13ZengMDPI AGMathematics2227-73902020-11-01811196010.3390/math8111960A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning ProblemAlejandro Marrero0Eduardo Segredo1Coromoto León2Carlos Segura3Departamento de Ingeniería Informática y de Sistemas, Universidad de La Laguna, Apto. 456. 38200 San Cristóbal de La Laguna, Tenerife, SpainDepartamento de Ingeniería Informática y de Sistemas, Universidad de La Laguna, Apto. 456. 38200 San Cristóbal de La Laguna, Tenerife, SpainDepartamento de Ingeniería Informática y de Sistemas, Universidad de La Laguna, Apto. 456. 38200 San Cristóbal de La Laguna, Tenerife, SpainÁrea de Computación, Centro de Investigación en Matemáticas, A.C. 36023 Guanajato, MexicoEncouraging healthy and balanced diet plans is one of the most important action points for governments around the world. Generating healthy, balanced and inexpensive menu plans that fulfil all the recommendations given by nutritionists is a complex and time-consuming task; because of this, computer science has an important role in this area. This paper deals with a novel constrained multi-objective formulation of the menu planning problem specially designed for school canteens that considers the minimisation of the cost and the minimisation of the level of repetition of the specific courses and food groups contained in the plans. Particularly, this paper proposes a multi-objective memetic approach based on the well-known multi-objective evolutionary algorithm based on decomposition (MOEA/D). A crossover operator specifically designed for this problem is included in the approach. Moreover, an ad-hoc iterated local search (ILS) is considered for the improvement phase. As a result, our proposal is referred to as ILS-MOEA/D. A wide experimental comparison against a recently proposed single-objective memetic scheme, which includes explicit mechanisms to promote diversity in the decision variable space, is provided. The experimental assessment shows that, even though the single-objective approach yields menu plans with lower costs, our multi-objective proposal offers menu plans with a significantly lower level of repetition of courses and food groups, with only a minor increase in cost. Furthermore, our studies demonstrate that the application of multi-objective optimisers can be used to implicitly promote diversity not only in the objective function space, but also in the decision variable space. Consequently, in contrast to the single-objective optimiser, there was no need to include an explicit strategy to manage the diversity in the decision space in the case of the multi-objective approach.https://www.mdpi.com/2227-7390/8/11/1960menu planning problemevolutionary algorithmdecomposition-based multi-objective optimisationmemetic algorithmiterated local searchdiversity preservation |
| spellingShingle | Alejandro Marrero Eduardo Segredo Coromoto León Carlos Segura A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem Mathematics menu planning problem evolutionary algorithm decomposition-based multi-objective optimisation memetic algorithm iterated local search diversity preservation |
| title | A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem |
| title_full | A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem |
| title_fullStr | A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem |
| title_full_unstemmed | A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem |
| title_short | A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem |
| title_sort | memetic decomposition based multi objective evolutionary algorithm applied to a constrained menu planning problem |
| topic | menu planning problem evolutionary algorithm decomposition-based multi-objective optimisation memetic algorithm iterated local search diversity preservation |
| url | https://www.mdpi.com/2227-7390/8/11/1960 |
| work_keys_str_mv | AT alejandromarrero amemeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT eduardosegredo amemeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT coromotoleon amemeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT carlossegura amemeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT alejandromarrero memeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT eduardosegredo memeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT coromotoleon memeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem AT carlossegura memeticdecompositionbasedmultiobjectiveevolutionaryalgorithmappliedtoaconstrainedmenuplanningproblem |