Hybridization of Neighbourhood Search Metaheuristic with Data Mining Technique to Solve p-median P roblem
Ssvn. Sarma · 2012
Co mbinatorial optimizat ion is the most panoptic area in current research paper. The p-median problem wh ich is a combinatorial optimization problem is NP-Hard in nature that realizes facilitators which serves the maximu m locations. The p-med ian problem will be practical in several applications areas such as escalating marketing strategies in the sphere of Management Sciences and in locating server positions in co mputer networks. In the proposed work the Metaheuristic based on Neighbourhood Search (NS) is hybridized with Data Min ing Technique (HDMNS) with Frequent Mining to provide a solution to p-median problem. The resulting local optimal solution fro m NS method serves as a basis for identification of feasible solution space that holds different possible solutions of similar size and by the application of frequent mining technique on it results in identificat ion of frequent items. Basing on the support count, most feasible solution is identified.