Two Efficient Algorithms for Weighted P-Median Problem
We propose a genetic algorithm for a weighted p-median problem. It is a facility location problem. The algorithm generates a good solution quickly. Computational tests were realized on five different tasks from 21 vertices to 100 vertices and from p-median from p=3 to p=6. The tests were performed 1...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2015-05-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-201502-0009_two-efficient-algorithms-for-weighted-p-median-problem.php |