DocumentCode
2307313
Title
Clustering problem based on ant colony algorithm and it’s application in dietary nutrition decision supporting system
Author
Li, Cui ; Gaoping, Wang
Author_Institution
Coll. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
397
Lastpage
400
Abstract
The work presented in this thesis is part of the research carried out in the dietary nutrition decision supporting problem (DNDSP) [1]. This thesis consist of two parts. The first part presents ant colony algorithmpsilas basic principle and its typical application in traveling salesman problem(TSP). Firstly, put forward the clustering analysis, which based on the ant colony algorithm, the incursion 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 Dietary 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 algorithmpsilas validity.
Keywords
decision support systems; medical computing; network operating systems; optimisation; pattern clustering; Asp.Net network technology; Chinese dietary reference intake; ant colony algorithm; clustering analysis; dietary nutrition decision supporting system; Algorithm design and analysis; Ant colony optimization; Clustering algorithms; Educational institutions; Educational technology; Information science; Network servers; Routing; Systems engineering education; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
IT in Medicine and Education, 2008. ITME 2008. IEEE International Symposium on
Conference_Location
Xiamen
Print_ISBN
978-1-4244-3616-3
Electronic_ISBN
978-1-4244-2511-2
Type
conf
DOI
10.1109/ITME.2008.4743894
Filename
4743894
Link To Document