UUM Electronic Theses and Dissertation
UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

Menu Planning Model for Malaysian Boarding School Using Self-Adaptive Hybrid Genetic Algorithms

Siti Noor Asyikin, Mohd Razali (2011) Menu Planning Model for Malaysian Boarding School Using Self-Adaptive Hybrid Genetic Algorithms. PhD. thesis, Universiti Utara Malaysia.

[thumbnail of Siti_Noor_Asyikin_Mohd_Razali.pdf] PDF
Restricted to Registered users only

Download (16MB) | Request a copy
[thumbnail of 1.Siti_Noor_Asyikin_Mohd_Razali.pdf]

Download (798kB) | Preview


Malnutrition problem is the gravest single threat to the world's public health today. Statistics have showed that the number of under-nourished and over-nourished children
and adolescents is increasing day by day. Thus, proper menu planning process among menu planners or caterers is important to avoid some diet-related diseases in the hture.
Manual calculation of menu planning is unable to consider macronutrients and micronutrients simultaneously due to complexities of data and length of time. In this study, self-adaptive hybrid genetic algorithm (SHGA) approach has been proposed to solve the menu planning problem for Malaysian boarding school students aged 13 to 18 years old. The objectives of our menu planning model are to optimize the budget allocation for each student, to take into consideration the caterer's ability, to llfill the standard recommended nutrient intake (RNI) and maximize the variety of daily meals. New local search was adopted in this study, the insertion search with delete-and-create (ISDC) method, which combined the insertion search (IS) and delete-and-create (DC) local search method. The implementation of IS itself could not guarantee the production of feasible solutions as it only explores a small neighborhood area. Thus, the ISDC was utilized to enhance the search towards a large neighborhood area and the results indicated that the proposed algorithm is able to produce 100% feasible solutions with the best fitness value. Besides that, implementation of self-adaptive probability for mutation has significantly minimized computational time taken to generate the good solutions in just few minutes. Hybridization technique of local search method and self-adaptive strategy have improved the performance of traditional genetic algorithm through balanced exploitation and exploration scheme. Finally, the present study has developed a menu planning prototype for caterers to provide healthy and nutritious daily meals using simple and fhendly user interface.

Item Type: Thesis (PhD.)
Supervisor : Engku Abu Bakar, Engku Muhammad Nazri and Ku Mahamud, Ku Ruhana
Item ID: 2825
Subjects: Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions: College of Arts and Sciences (CAS)
Date Deposited: 04 Jun 2012 08:14
Last Modified: 28 Apr 2016 00:33
Department: College of Arts and Sciences
Name: Engku Abu Bakar, Engku Muhammad Nazri and Ku Mahamud, Ku Ruhana
URI: https://etd.uum.edu.my/id/eprint/2825

Actions (login required)

View Item
View Item