Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14676
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUMAR, SANJAY-
dc.date.accessioned2016-05-04T10:04:43Z-
dc.date.available2016-05-04T10:04:43Z-
dc.date.issued2016-04-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14676-
dc.description.abstractABSTRACT Optimization problem is a very common problem of finding the best solution from all feasible solutions. It is also a very common problem both in theoretical and practical scenes. In most cases optimization problem is also been classified as a NP-Hard problem. In today’s era, time and computing resources are most common limitations. People often choose such metaheuristic methods that evaluate the optimal value in a limited time and with a limited computing resource. Artificial Bee Colony (ABC) is newly proposed metaheuristic algorithm which is suggested very compromising in recent work. As compared with the other metaheuristic algorithms, ABC is very effective for high dimensional problems. ABC can also solve various optimization problems with complex nonlinearity because it is a fast and robust algorithm. In this work, we have proposed a parallel implementation of Artificial Bee Colony algorithm for analysis of big data by using MapReduce paradigm. During the implementation of this work, Hadoop has been used as the backend MapReduce platform. As the result shows our ABC algorithm is very effective and scalable.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTD 2052;-
dc.subjectARTIFICIAL BEE COLONYen_US
dc.subjectALGORITHMen_US
dc.subjectAPACHE HADOOPen_US
dc.subjectHADOOP CLUSTERen_US
dc.titleAPPLICATION OF ARTIFICIAL BEE COLONY ALGORITHM USING HADOOPen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Technology & Applications

Files in This Item:
File Description SizeFormat 
1PG.pdf33.49 kBAdobe PDFView/Open
pre.pdf377.66 kBAdobe PDFView/Open
ABC_Final(2).pdf1.85 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.