Genetic algorithm design of the Min -max weighted distance problem

The location problem is one kind of special type optimized problems. The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP-Complete problem. This paper designs a genetic algorithm by some properties of the problem, and gives the design and selection method of crossover operator, mutation operator and reproduction operator.