Metaheuristic Approach Based on Neighbourhood Search for Solving P-Median Problem

Now a day there is much more amplified curiosity in combinatorial optimization. The p-median problem which is a facility location problem, deals with discrete data and hence it is characterized as a combinatorial optimization problem. It is NP-Hard in nature that ascertains the specified number of locations as facilitators which serves the maximum locations. The p-median problem will be productive in several applications areas such as mounting marketing strategies in Management Sciences and recognition of server positions in computer networks. A new Metaheuristic approach with Neighbourhood Search (NS) technique has been proposed in the present paper which unveil all possible combinations with the elements in the neighbourhood of individual elements in the solution and recognizes the optimal solution i.e., which serves the maximum locations so that the sum of the total distance from the each element to the facilities is minimized. The proposed metaheuristic approach is an iterative one which contains two phases. Construction phase is the first phase that structure the initial solution and based on the initial solution the second phase explore for the optimal solution based on NS approach and then the probable solution space is computed to obtain the optimal solution.

[1]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[2]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[3]  Alexandre Plastino,et al.  Hybridization of GRASP Metaheuristic with Data Mining Techniques , 2006, J. Math. Model. Algorithms.

[4]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[5]  Fabrizio Silvestri,et al.  Adaptive and resource-aware mining of frequent sets , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[6]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[7]  Alexandre Plastino,et al.  Applications of the DM-GRASP heuristic: a survey , 2008, Int. Trans. Oper. Res..

[8]  Bart Goethals,et al.  Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03 , 2003, FIMI.

[9]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[10]  Alex Alves Freitas,et al.  A Hybrid Data Mining Metaheuristic for the p-Median Problem , 2009, SDM.

[11]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[12]  Saïd Salhi,et al.  A cellular heuristic for the multisource Weber problem , 2003, Comput. Oper. Res..

[13]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[14]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[15]  Alexandre Plastino,et al.  A Hybrid GRASP with Data Mining for the Maximum Diversity Problem , 2005, Hybrid Metaheuristics.

[16]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[17]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[18]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[19]  Alexandre Plastino,et al.  Hybridization of GRASP Metaheuristics with Data Mining Techniques , 2004, Hybrid Metaheuristics.

[20]  Alexandre Plastino,et al.  NGL01-4: A Hybrid GRASP with Data Mining for Efficient Server Replication for Reliable Multicast , 2006, IEEE Globecom 2006.

[21]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[22]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[23]  Sunil Nadella,et al.  A hybrid k-Mean-GRASP for partition based Clustering of two-dimensional data space as an application of p-median problem , 2012 .

[24]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[25]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[26]  Said Salhi.  Heuristic Search: The Science of Tomorrow , 2006 .

[27]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .