Applying Parallel Recursive Genetic Algorithms to Stackelberg Location Problem with Side-trip Distance

Abstract

We consider the Stackelberg facility location game in urban area. This is a competitive model for nonessential facility such as fast food restaurant, coffee shop, etc. Commuters at demand points are assumed to visit the facility on their way to the nearest station, only when they feel the facility is near. We introduce side-trip distance and concept of nearness for this model. We formulate medianoid problem and centroid problem which objectives are to etermine the best location for the follower and for the leader respectively. We propose Recursive Genetic Algorithms with parallel processing to find the approximate solutions for these problems and show the result of numerical experiments.