IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_38.html
   My bibliography  Save this book chapter

Uniform Deployment of the p-Location Problem Solutions

In: Operations Research Proceedings 2019

Author

Listed:
  • Jaroslav Janáček

    (University of Žilina, Faculty of Management Science and Informatics)

  • Marek Kvet

    (University of Žilina, Faculty of Management Science and Informatics)

Abstract

The uniform deployment has emerged from the need to inspect the enormously large set of feasible solutions of an optimization problem and due to inability of the exact methods to terminate the computation in an acceptable time. The objective function values of the solutions of the uniformly deployed set enable to determine areas of great interest. The uniformly deployed set can also represent population with maximal diversity for evolutionary metaheuristics. The paper deals with a notion of uniformity based on minimal Hamming distance between each pair of solutions. The set of selected solutions is considered to be uniformly deployed if the minimal Hamming distance across the set of all pairs of selected solutions is greater than or equal to a given threshold and if there is no possibility to add any other solution to the set. The paper contains a way of suggesting an initial uniformly deployed set of solutions and an iterative approach to the set enlargement.

Suggested Citation

  • Jaroslav Janáček & Marek Kvet, 2020. "Uniform Deployment of the p-Location Problem Solutions," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 315-321, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_38
    DOI: 10.1007/978-3-030-48439-2_38
    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.

    More about this item

    Statistics

    Access and download statistics

    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-030-48439-2_38. 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.