Name
Abstract | ||
|---|---|---|
We propose a new genetic algorithm for a well-known facility location problem. The algorithm is relatively simple and it generates good solutions quickly. Evolution is facilitated by a greedy heuristic. Computational tests with a total of 80 problems from four different sources with 100 to 1,000 nodes indicate that the best solution generated by the algorithm is within 0.1% of the optimum for 85% of the problems. The coding effort and the computational effort required are minimal, making the algorithm a good choice for practical applications requiring quick solutions, or for upper-bound generation to speed up optimal algorithms. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1026130003508 | Annals of Operations Research |
Keywords | Field | DocType |
facility location, p-median, genetic algorithm, heuristic | Mathematical optimization,Min-conflicts algorithm,Out-of-kilter algorithm,Greedy algorithm,FSA-Red Algorithm,Facility location problem,Null-move heuristic,Population-based incremental learning,Mathematics,Genetic algorithm | Journal |
Volume | Issue | ISSN |
122 | 1 | 1572-9338 |
Citations | PageRank | References |
101 | 5.86 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Osman Alp | 1 | 164 | 10.67 |
| Erhan Erkut | 2 | 692 | 47.66 |
| Zvi Drezner | 3 | 1195 | 140.69 |