Abstract
The maximum capture (MAXCAP) model and its variants have been widely used to find the maximum capture that a firm can get as it enters a spatial market where there are already existing (competitor’s) facilities. While the model obtains the optimal demand capture, it however allows the customers to be assigned to the non-closest facility which may incur additional operating costs. A two stage method can be used that overcomes the drawback of the original model while requiring a negligible extra computational effort. To make the original model mathematically self contained and more concise two revised formulations of the problem RMAXCAP-1 and RMAXCAP-2 are proposed which assure that the customers patronize only their closest entering facilities. These models are tested on different sizes of datasets and their performances are compared.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Belotti, P., Labbé, M., Maffioli, F., Malick, M.: A branch-and-cut method for the obnoxious p-median problem. 4OR: A Qrty. J. of Oper. Res. 5(4), 299–314 (2007)
Church, R.L., ReVelle, C.S.: The maximal covering location problem. Pap. Reg. Sci. Assoc. 32, 101–118 (1974)
Colomé, R., Lourenço, H.R., Serra, D.: A new chance - constrained maximum capture location problem. Ann. Oper. Res. 122, 121–139 (2003)
Eiselt, H.A., Laporte, G.: Competitive spatial models. Eur. J. Oper. Res. 39(3), 231–242 (1989)
Gerrard, R.A., Church, R.L.: Closest assignment constraints and location models: properties and structure. Location Science 4(4), 251–271 (1996)
Huff, D.: Defining and estimating a trading area. J. Mark. 28, 34–38 (1964)
Karkazis, J.: Facilities location in a competitive environment: a promethee based multiple criteria analysis. Eur. J. Oper. Res. 42, 294–304 (1989)
Pelegrín, B., Redondo, L.J., Fernández, P., García, I., Ortigosa, P.M.: GASUB: finding global optima to discrete location problems by a genetic-like algorithm. J. Glob. Optim. 38, 249–264 (2007)
ReVelle, C.: The maximum capture or “sphere of influence” location problem hotelling revisited on a network. J. Reg. Sci. 26(2), 343–358 (1986)
ReVelle, C., Serra, D.: The maximum capture problem including relocation. Info. Oper. Res. 29(2), 130–138 (1991)
Serra, D., Colomé, R.: Maximum consumer choice and optimal locations models: Formulations and heuristics. Pap. Reg. Sci. 80, 439–464 (2001)
Serra, D., Eiselt, H.A., Laporte, G., ReVelle, C.S.: Market capture models under various customer choice rules. Environ. Plann. B Plann. Des. 26(5), 741–750 (1999)
Serra, D., Marianov, V., ReVelle, C.: The hierarchical maximum capture problem. Eur. J. Oper. Res. 62(3), 58–69 (1992)
Serra, D., ReVelle, C.: Maximum Capture Model with Uncertainty. Environment and Planning 74. Universitat Pompeu Fabra (1994)
Serra, D., ReVelle, C.: Competitive location in discrete space. In: Drezner, Z. (ed.) Facility Location: A Survey of Applications and Methods, pp. 367–386. Springer, NewYork (1995)
Serra, D., ReVelle, C., Rosing, K.: Surviving in a competitive spatial market: the threshold capture model. J. Reg. Sci. 39(4), 637–652 (1999)
Silva, F., Serra, D.: Incorporating waiting time in competitive location models: formulations and heuristics. Networks and Spatial Economics 7(1), 63–76 (2007)
Teixeira, J.C., Antunes, A.P.: A hierarchical location model for public facility planning. Eur. J. Oper. Res. 185(1), 92–104 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the Algerian Ministry of Education, PNR (Sciences Fondamentales 8/U160/64), and also by the Ministry of Science and Innovation of Spain under the research project ECO2011-24927, in part financed by the European Regional Development Fund (ERDF), and the Fundacion Seneca under the research project 15254/PI/10
Rights and permissions
About this article
Cite this article
Shaikh, A., Salhi, S. & Ndiaye, M.M. Customer Allocation in Maximum Capture Problems. J Math Model Algor 11, 281–293 (2012). https://doi.org/10.1007/s10852-012-9185-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-012-9185-5