A comparison of two heuristic methods for the p-median problem with and without maximum distance constraints

A comparison of two heuristic methods for the p-median problem with and without maximum distance constraints

0.00 Avg rating0 Votes
Article ID: iaor199277
Country: United Kingdom
Volume: 11
Start Page Number: 76
End Page Number: 84
Publication Date: Nov 1991
Journal: International Journal of Operations & Production Management
Authors: ,
Keywords: service, heuristics
Abstract:

The performance of Ardalan’s heuristic is compared with that of Teitz and Bart for the location of service facilities, where performance is assessed in terms of the accuracy of solutions. The comparison is made considering two kinds of location problem: p-median and p-median with maximum distance constraints. The results indicate that the Teitz and Bart method generally produces a better solution than the Ardalan method for both problems.

Reviews

Required fields are marked *. Your email address will not be published.