Genetic Algorithms for A Competitive Location Problem

Abstract

In this paper, we develop genetic algorithms for the competitive location problem addressed by Ho, Karmarkar, and Rhim in 1997 (hereafter, HKR). The implemented genetic algorithms are tested for various sizes of problems. Genetic algorithms are search algorithms which simulate natural processes of evolution. Since the primary monograph by Holland (1975), genetic algorithms have been

proven to be robust search methods for complex functions and have been applied to various areas, including optimization problems such as scheduling, location, traveling salesman problems.