A Genetic Algorithm for the P-Median Facility Location Problem (original) (raw)
The p-median problem is one of the most well-known facility location problem and have several applications in transportation, distribution, location of public, warehouses etc. The objective is to locate p facilities (medians) such that the sum of the distances from each demand point to its nearest facility is minimized. The p-median problem is well known to be NP-hard and several heuristics have been developed in the literature, but there are few applications of genetic algorithms for this problem. In this study, a new genetic algorithm approach to solve uncapacitated p-median problem is proposed. The parameters of the genetic algorithm are tuned using design of experiments approach. The proposed algorithm is tested on several instances of benchmark data set and evaluated with optimal solutions of the problems.
Related papers
Optimizing Facility Location Problem Using Genetic Algorithm
2011
Facility location problem have several application in telecommunication, transportation, distribution etc. One of the most well-known facility location problems is the p-median problem. We use genetic algorithm to solve the capacitated p-median problem. In this paper we solve a real problem and give their computational results.
Implementing Genetic Algorithm to solve Facility Location Problem
2015
Facility location problem is the problem of finding optimal location for facilities in a plane consisting of demand points so that each demand point has at least one facility at a distance no more than some permissible distance. Facility location problem has its wide spread application in all areas. The problem of Facility location arises when it is to be decided where to locate a printer, server, ware house or where to open a new store of a business chain. Facility location problem have several application in telecommunication, transportation, distribution etc. This widespread application of Facility Location Problem has invited many researchers to try their hand to solve the problem. The problem of Facility Location is a well known NP-hard problem and various heuristics have been proposed over the time to solve the problem. There exist multiple variants of the facility location problem like p-center problem or p-median problem. Here in this paper, we have attempted to solve the we...
Modied Genetic Algorithm with Greedy Heuristic for Continuous and Discrete p-Median Problems
Genetic algorithm with greedy heuristic is an efficient method for solvinglarge-scale location problems on networks. In addition, it can be adapted for solvingcontinuous problems such as k-means. In this article, authors propose modicationsto versions of this algorithm on both networks and continuous space improving itsperformance. The Probability Changing Method was used for initial seeding of thecenters in case of the p-median problem on networks.Results are illustrated by numerical examples and practical experience of clusteranalysis of semiconductor device production lots.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.