Communications - Scientific Letters of the University of Zilina 2015, 17(2):55-59 | DOI: 10.26552/com.C.2015.2.55-59

Two Efficient Algorithms for Weighted P-Median Problem

Vladimir Medvid1
1 Department of Mathematics, Faculty of Humanities, University of Zilina, Slovakia

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 100 times on every task. There were created some modifications of these tasks for a proposed genetic algorithm.

The best solution generated by this algorithm is within 0.6% of the optimum for 80% of the tasks. The other 20% of the tasks is within 1.6% of the optimum. Time of realization is within 5.9 s.

Keywords: model; linear programing; p-median problem; optimal solution; arithmetic mean

Published: May 31, 2015  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Medvid, V. (2015). Two Efficient Algorithms for Weighted P-Median Problem. Communications - Scientific Letters of the University of Zilina17(2), 55-59. doi: 10.26552/com.C.2015.2.55-59
Download citation

References

  1. BUZNA, L., KOHANI, M., JANACEK, J.: Proportionally Fairer Public Service Systems Design, Communications - Scientific Letters of the University of Zilina, vol. 15, No. 1, 2013, pp. 14-18. Go to original source...
  2. JANACEK, J., GABRISOVA, L.: Lagrangean Relaxation Based Approximate Approach to the Capacitated Location Problem, Communications - Scientific Letters of the University of Zilina, vol. 8, No. 3, 2006, pp. 19-24. Go to original source...
  3. JANACEK, J., JANOSIKOVA, L.: Computability of the Emergency Service System Design Problem, Communications - Scientific Letters of the University of Zilina, vol. 10, No. 2, 2008, 2013, pp. 5-9. Go to original source...
  4. MEDVID, V.: A Proposal of Algorithm for Solving p-median Problem, Proc. of 21th annual conference Technical computing Prague 2013 [electronic source] Prague: Institute of chemical technology, 2013 - CD-ROM [7].
  5. ALP, O., ERCUT, E.: An Efficient Genetic Algorithm for the p-Median Problem, Annals of Operations Research, 122, 2003, pp. 21-42. Go to original source...
  6. HERDA, M.: Construction of Some Models of Linear Programming Problems, Thesis, Faculty of Humanities: University of Zilina, 2014, pp. 39-46.

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.