An approach for solving maximal covering location problems with fuzzy constraints

17Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Several real-world situations can be modeled as maximal covering location problem (MCLP), which is focused on finding the best locations for a certain number of facilities that maximizes the coverage of demand nodes located within a given exact coverage distance (or travel time). In a real scenario, such distance as well as other elements of the location problem can be uncertain or linguistically (vaguely) defined by the decision maker. In this paper, we manage flexibility in the coverage distance through a fuzzy constraint. So, an extension of the original MCLP model is proposed, which is solved by using a parametric approach. Computational experiments have been conducted to analyze how the proposed model can be solved and what kind of information can be obtained to help a potential decision maker to take a more informed decision.

Cite

CITATION STYLE

APA

Guzmán, V. C., Pelta, D. A., & Verdegay, J. L. (2016). An approach for solving maximal covering location problems with fuzzy constraints. International Journal of Computational Intelligence Systems, 9(4), 734–744. https://doi.org/10.1080/18756891.2016.1204121

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free