Abstract
A greedy-type heuristic is presented for the p-median problem and computational results for problems having up to 400 vertices are shown. We describe a dual heuristic procedure for the p-median based on Erlenkotter's heuristic (1978) for the uncapacitated facility location problem. A primal-dual heuristic that generates a primal solution based on a good dual solution is also presented. For both procedures, computational experience relative to the same set of large size test problems is reported. Finally, the results obtained from all procedures are compared with the bounds, and corresponding computing times, provided by other available heuristics for the p-median location problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
