DOI: 10.7763/IJCTE.2014.V6.859
Application of Local Search for Optimal Assignment of Food Exchange Lists Problem
Abstract—This paper proposed an efficient local search (LS)
technique for solving optimal assignment of food exchange lists
problem under these constraints, energy and quantity limits.
The proposed LS is improved by backtracking mechanism
(BT). The objective function and its constraints were explained
and conducted how to map into a real value for LS to minimize
subjected to constraints. Experimental tests were divided into
three cases, underweight-male, normal weight-female and
overweight-female. Computational efforts were set to 20 trials
for each case. The results show that the proposed LS can
confirm significantly reduction of searching time for each
complete assignment of a food exchange list, many thousands
times with respect to a man doing.
Index Terms—Food exchange list, ideal body weight, local
search technique, backtracking mechanism.
A. Dholvitayakhun is with Agricultural Industry Department,
Rajamangala University of Technology Lanna, Tak 63000 Thailand (e-mail:
achara2518@yahoo.co.th).
J. Kluabwang is with the Electrical Engineering Department,
Rajamangala University of Technology Lanna, Tak 63000 Thailand (e-mail:
jukkrit_k@rmutl.ac.th).
Cite:Achara Dholvitayakhun and Jukkrit Kluabwang, "Application of Local Search for Optimal Assignment of Food Exchange Lists Problem," International Journal of Computer Theory and Engineering vol. 6, no. 2, pp. 189-191, 2014.