IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v253y2016i2p280-289.html
   My bibliography  Save this article

Exact and heuristic algorithms for the Hamiltonian p-median problem

Author

Listed:
  • Erdoğan, Güneş
  • Laporte, Gilbert
  • Rodríguez Chía, Antonio M.

Abstract

This paper presents an exact algorithm, a constructive heuristic algorithm, and a metaheuristic for the Hamiltonian p-Median Problem (HpMP). The exact algorithm is a branch-and-cut algorithm based on an enhanced p-median based formulation, which is proved to dominate an existing p-median based formulation. The constructive heuristic is a giant tour heuristic, based on a dynamic programming formulation to optimally split a given sequence of vertices into cycles. The metaheuristic is an iterated local search algorithm using 2-exchange and 1-opt operators. Computational results show that the branch-and-cut algorithm outperforms the existing exact solution methods.

Suggested Citation

  • Erdoğan, Güneş & Laporte, Gilbert & Rodríguez Chía, Antonio M., 2016. "Exact and heuristic algorithms for the Hamiltonian p-median problem," European Journal of Operational Research, Elsevier, vol. 253(2), pages 280-289.
    • Handle: RePEc:eee:ejores:v:253:y:2016:i:2:p:280-289
    DOI: 10.1016/j.ejor.2016.02.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716300327
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.02.012?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Barbato, Michele & Gouveia, Luís, 2024. "The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms," European Journal of Operational Research, Elsevier, vol. 316(2), pages 473-487.
    2. Bektaş, Tolga & Gouveia, Luís & Santos, Daniel, 2019. "Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 276(1), pages 40-64.

    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:eee:ejores:v:253:y:2016:i:2:p:280-289. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.