Clustering Problem based on Ant Colony Algorithm and it's Application in Dietary Nutrition Decision Supporting System

摘要

The work presented in this thesis is part of the research carried out in the dietary nutrition decision supporting problem (DNDSP). This thesis consist of two parts.The first part presents ant colony algorithm's basic principle and its typicle application in traveling salesman problem(TSP).Firstly, put forward the chtstering analysis ,which based on the ant colony algorithm, the incretion in each path would be renewed in each searching time, then the path which had the most incretion would be selected as the result. The second part of the thesis mainly involves with its application in DNDSP and sums up the research result with forms.,combining technology of Asp.Net, network technology and Chinese Dietwy Reference Intakes (DRIs), the based Browser/Server dietary decision support system is developed as the previous requirement, and the details implement is showed subsequently;Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to DNDSP, meanwhile show algorithm's validity.