Application of Local Search for Optimal Assignment of Food Exchange Lists Problem

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.