Approximate Algorithms 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. In this paper, some approximate algorithms are designed, 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 polynomial-time algorithm approximate algorithms genetic algorithm

作者: Lin Liu Dayong Wu

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

会议类型: 国际会议

会议名称: 2010 4th International Conference on Intelligent Information Techonlogy Application(第四届智能信息技术应用国际学术研讨会 IITA 2010)

会议地点: 秦皇岛

会议语种:英文

页码: 245-248

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