Article ID: | iaor20032243 |
Country: | Netherlands |
Volume: | 37 |
Issue: | 1 |
Start Page Number: | 69 |
End Page Number: | 80 |
Publication Date: | Mar 2003 |
Journal: | Socio-Economic Planning Sciences |
Authors: | Saydam Cem, Aytu Haldun |
Keywords: | programming: integer, sets |
As noted in several studies, the accurate estimation of expected coverage is an important and open issue. Although the maximum expected coverage model is empirically shown to prescribe a robust set of ‘optimal’ locations, earlier findings suggest that it could also over- or underestimate the coverage by a significant margin. In this study, we present a genetic algorithm (GA) that combines the expected coverage approach with the hypercube model to solve the maximum expected coverage location problem with increased accuracy and realism. Our findings suggest that the GA provides at least as good solutions 94% of the time making it a viable alternative to the two-step procedures stipulated earlier.