Article ID: | iaor20023140 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 6 |
Start Page Number: | 761 |
End Page Number: | 779 |
Publication Date: | May 2002 |
Journal: | Computers and Operations Research |
Authors: | Batta Rajan, Bhadury Joyendu, Jaramillo Jorge H. |
Keywords: | heuristics |
This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of the GA-based heuristics developed against well-known heuristics from the literature, using a test base of publicly available data sets.