Constructing a Genetic Algorithm for Location Problems of Urban Facilities

Abstract

In this paper, we construct a genetic algorithm (GA) for location problems of urban facilities. In the encoding of the GA, loci and alleles are defined as sites for placements and types of the facilities, respectively. An individual is a planar array. The genetic operators are selection, crossover and mutation. In the selection, roulette selection and elitist preserving selection are used. In the crossover, 2 selected individuals are each divided into 4 by 2 straight lines which are selected at random. One of the 4 divided parts is selected at random. The selected part is changed between the 2 individuals. In the mutation, a facility or a residence is randomly placed in the randomly selected locus. For fitness, the GA uses the results of the evaluating system which we have proposed. We execute simulation for placement of urban facilities and consider the results of the simulation.