IDEAS home Printed from https://ideas.repec.org/a/fau/aucocz/au2013_119.html
   My bibliography  Save this article

Comprehensive Approximate Sequential Tool for Public Service System Design

Author

Listed:
  • Marek Kvet

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

  • Jaroslav Janáček

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

Abstract

This paper deals with the approximate approach to the p-median problem, which constitutes a background for the public service system design. The real instances are characterized by thousands of possible service center locations. The attempts at exact solving of these problems often fail due to enormous computational time or huge memory demands, when the location-allocation model is used. The presented approach uses an approximation of a common distance by some pre-determined distances given by so-called dividing points. Covering formulation of the problem enables the implementation of the solving technique in the frame of commercial optimization software to obtain near-optimal solution in a short term. As the deployment of the dividing points influences the accuracy of the solution, we have developed the sequential method of dividing point deployment. The main goal of this study is to explore the effectiveness of suggested approximate method measured by the solution accuracy in comparison to the sav ed computational time.

Suggested Citation

  • Marek Kvet & Jaroslav Janáček, 2013. "Comprehensive Approximate Sequential Tool for Public Service System Design," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 7(2), pages 119-127, July.
  • Handle: RePEc:fau:aucocz:au2013_119
    as

    Download full text from publisher

    File URL: http://auco.cuni.cz/mag/article/download/id/146/type/attachment
    Download Restriction: no

    More about this item

    Keywords

    p-median problem; approximate covering model; lower bound; sequential method;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:fau:aucocz:au2013_119. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lenka Stastna). General contact details of provider: http://edirc.repec.org/data/icunicz.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.