Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran
by Hassan Rezazadeh; Salim Moghtased-Azar; Meysam Shafiei Kisomi; Rouhollah Bagheri
International Journal of Services and Operations Management (IJSOM), Vol. 29, No. 2, 2018

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.

Online publication date: Thu, 11-Jan-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com