Abstract
AbstractIn this paper, consecutive meals planning is formulated as a multiset iteration permutation problem that determines the optimal meals plan on a period consisting of consecutive days. In this problem, a meal is characterized by some characteristics such as food style, ingredient, cooking method, and so on. The evaluation function is defined by use of information entropy for measuring the appearance order of meal's characteristics on the meals plan. For optimizing this problem, Genetic Algorithms (GAs) with escape from stagnation of search are proposed. It is empirically shown that the proposed GAs with escape operation work better than the conventional permutation GA without escape operation for small and large size optimization problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
