A dynamic programming heuristic for the P-median problem

Michelle Hribar, Mark S. Daskin

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

A new heuristic algorithm is proposed for the P-median problem. The heuristic restricts the size of the state space of a dynamic programming algorithm. The approach may be viewed as an extension of the myopic or greedy adding algorithm for the P-median model. The approach allows planners to identify a large number of solutions all of which perform well with respect to the P-median objective of minimizing the demand weighted average distance between customer locations and the nearest of the P selected facilities. In addition, the results indicate regions in which it is desirable to locate facilities. Computational results from three test problems are discussed.

Original languageEnglish (US)
Pages (from-to)499-508
Number of pages10
JournalEuropean Journal of Operational Research
Volume101
Issue number3
DOIs
StatePublished - Sep 16 1997
Externally publishedYes

Keywords

  • Dynamic programming
  • Heuristics
  • Location

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'A dynamic programming heuristic for the P-median problem'. Together they form a unique fingerprint.

Cite this