The large scale maximal covering location problem

Zarandi, M. H. Fazel, Davari, Soheil and Sisakht, S. A. Haddad 2011. The large scale maximal covering location problem. Scientia Iranica 18 (6) , pp. 1564-1570. 10.1016/j.scient.2011.11.008

Full text not available from this repository.

Abstract

The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper presents a customized Genetic Algorithm (GA) to solve MCLP instances, with up to 2500 nodes. Results show that the proposed approach is capable of solving problems with a fair amount of exactness. In order to fine-tune the algorithm, Tukey’s Least Significant Difference (LSD) tests are employed on a set of test problems.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Elsevier
ISSN:	1026-3098
Last Modified:	20 Jul 2017 04:03
URI:	https://orca.cardiff.ac.uk/id/eprint/68532

Citation Data

Cited 51 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item