IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v122y2003i1p21-4210.1023-a1026130003508.html
   My bibliography  Save this article

An Efficient Genetic Algorithm for the p-Median Problem

Author

Listed:
  • Osman Alp
  • Erhan Erkut
  • Zvi Drezner

Abstract

We propose a new genetic algorithm for a well-known facility location problem. The algorithm is relatively simple and it generates good solutions quickly. Evolution is facilitated by a greedy heuristic. Computational tests with a total of 80 problems from four different sources with 100 to 1,000 nodes indicate that the best solution generated by the algorithm is within 0.1% of the optimum for 85% of the problems. The coding effort and the computational effort required are minimal, making the algorithm a good choice for practical applications requiring quick solutions, or for upper-bound generation to speed up optimal algorithms. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Osman Alp & Erhan Erkut & Zvi Drezner, 2003. "An Efficient Genetic Algorithm for the p-Median Problem," Annals of Operations Research, Springer, vol. 122(1), pages 21-42, September.
    • Handle: RePEc:spr:annopr:v:122:y:2003:i:1:p:21-42:10.1023/a:1026130003508
    DOI: 10.1023/A:1026130003508
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1026130003508
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1026130003508?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:122:y:2003:i:1:p:21-42:10.1023/a:1026130003508. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.