IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-29210-1_43.html
   My bibliography  Save this book chapter

Sequential Zone Adjustment for Approximate Solving of Large p-Median Problems

In: Operations Research Proceedings 2011

Author

Listed:
  • Jaroslav Janacek

    (University of Zilina, Faculty of Management Science and Informatics)

  • Marek Kvet

    (University of Zilina, Faculty of Management Science and Informatics)

Abstract

The p-median problems are used very often for designing optimal structure of most public service systems. Since particular models are characterized by big number of possible facility locations, current exact approaches often fail. This paper deals with an approximate approach based on specific model reformulation. It uses an approximation of the network distance between a service center and a customer by some of pre-determined distances. The pre-determined distances are given by dividing points separating the range of possible distances. Deployment of these points influences the accuracy of the approximation. To improve this approach, we have developed a sequential method of the dividing point deployment.We study here the effectiveness of this method and compare the results to the former static method.

Suggested Citation

  • Jaroslav Janacek & Marek Kvet, 2012. "Sequential Zone Adjustment for Approximate Solving of Large p-Median Problems," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 269-274, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-29210-1_43
    DOI: 10.1007/978-3-642-29210-1_43
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Štefan PEŠKO & Tomáš MAJER, 2015. "Robust p-median problem in changing networks," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 10(3), pages 125-130, September.

    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:oprchp:978-3-642-29210-1_43. 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.