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-CompIete 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.

关键词： location genetic algorithm design

作者: Lin Liu Yuxia Zhang

作者单位: Department of Mathematics and Physics Zhengzhou Institute of Aeronautical Industrial Management Zhengzhou, China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 620-623

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）