A Comparison of Two Heuristic Methods for the p‐Median Problem with and without Maximum Distance Constraints

Shams‐ur Rahman (University of Dhaka, Bangladesh and currently a study fellow at the University of Exeter, UK)
David K. Smith (University of Exeter, UK)

International Journal of Operations & Production Management

ISSN: 0144-3577

Publication date: 1 June 1991

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.

Keywords

Citation

Rahman, S. and Smith, D.K. (1991), "A Comparison of Two Heuristic Methods for the p‐Median Problem with and without Maximum Distance Constraints", International Journal of Operations & Production Management, Vol. 11 No. 6, pp. 76-84. https://doi.org/10.1108/01443579110139778

Publisher

:

MCB UP Ltd

Copyright © 1991, MCB UP Limited

To read the full version of this content please select one of the options below

You may be able to access this content by logging in via Shibboleth, Open Athens or with your Emerald account.
To rent this content from Deepdyve, please click the button.
If you think you should have access to this content, click the button to contact our support team.