IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v51y2000i8d10.1057_palgrave.jors.2600990.html
   My bibliography  Save this article

Heuristics for multiple facility location in a network using the variance criterion

Author

Listed:
  • M C López de los Mozos

    (Universidad de Sevilla)

  • J A Mesa

    (Universidad de Sevilla)

Abstract

In cyclic networks the p-variance location problem is NP-hard, and therefore it is suitable to use heuristic methods to find approximate solutions to the problem. To this end, two strategies are explored, the first using combinatorial search procedures over the vertex set, whereas the second searches for the solution over the entire network. The initial vertex set solutions are generated by using tabu search, variable neighbourhood search and interchange procedures. The heuristics have been tested on instances of up to 30 vertices and 70 edges, and their performances compared.

Suggested Citation

  • M C López de los Mozos & J A Mesa, 2000. "Heuristics for multiple facility location in a network using the variance criterion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(8), pages 971-981, August.
    • Handle: RePEc:pal:jorsoc:v:51:y:2000:i:8:d:10.1057_palgrave.jors.2600990
    DOI: 10.1057/palgrave.jors.2600990
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600990
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600990?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:pal:jorsoc:v:51:y:2000:i:8:d:10.1057_palgrave.jors.2600990. 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.palgrave-journals.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.