Hybridization of Neighbourhood Search Metaheuristic with Data Mining Technique to Solve P-Median Problem
Combinatorial optimization is the most panoptic area in current research paper. The p-median problem which is a combinatorial optimization problem is NP-Hard in nature that realizes facilitators which serves the maximum locations. The p-median 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 computer networks. In this paper, the Metaheuristic based on Neighbourhood Search (NS) is Hybridized with Data Mining Technique (HDMNS) with Frequent Mining to provide a solution to p-median problem.