IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v29y2018i2p163-183.html
   My bibliography  Save this article

Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran

Author

Listed:
  • Hassan Rezazadeh
  • Salim Moghtased-Azar
  • Meysam Shafiei Kisomi
  • Rouhollah Bagheri

Abstract

Today, maximising the number of steady customers and consistency in meeting their needs are two important factors affecting the profitability of companies. Therefore, researchers are trying to model, study and analyse factors affecting the businesses. To this end and with regard to covering problem applications, this problem is inclusively studied in the operations research (OR) literature. This article proposes a novel maximal covering location problem (MCLP) in which different factors (capacity of facilities, budget, number of available facilities in different types) have been considered. To provide a real case problem, locating Tele-Taxi stations in Tabriz, Iran have been studied. Moreover, to analyse the effects of uncertainty in the rate of demand in each demand point and capacity of facilities as undeniable facts of real-world, the robust counterpart of the proposed model is developed. Furthermore, a sensitivity analysis on the constant perturbation for uncertain parameters has been conducted.

Suggested Citation

  • Hassan Rezazadeh & Salim Moghtased-Azar & Meysam Shafiei Kisomi & Rouhollah Bagheri, 2018. "Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 29(2), pages 163-183.
    • Handle: RePEc:ids:ijsoma:v:29:y:2018:i:2:p:163-183
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=89247
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijsoma:v:29:y:2018:i:2:p:163-183. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    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.