APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS

被引：178

作者：

FOGEL, DB

机构：

[1] ORINCON Corporation, San Diego, CA, 92121

来源：

CYBERNETICS AND SYSTEMS | 1993年 / 24卷 / 01期

关键词：

D O I：

10.1080/01969729308961697

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Natural evolution provides a paradigm for the design of stochastic-search optimization algorithms. Various forms of simulated evolution, such as genetic algorithms and evolutionary programming techniques, have been used to generate machine learning through automated discovery. These methods have been applied to complex combinatorial optimization problems with varied degrees of success. The present paper relates the use of evolutionary programming on selected traveling salesman problems. In three test cases, solutions that are equal to or better than previously known best routings were discovered. In a 1000-city problem, the best evolved routing is about 5% longer than the expected optimum.

引用

页码：27 / 36

页数：10

共 34 条

[31]

Schwefel H.-P., Kybernetische Evolution als Strategie der Strömungstechnik, Technical University of Berlin, (1965)

[32]

Schwefel H.-P., Numerical Optimization of Computer Models, (1981)

[33]

Stein D., Scheduling Dial-A-Ride Transportation Systems: An Asymptotic Approach, (1977)

[34]

Whitley D., Starkweather T., Fuquay D., Scheduling Problems and Traveling Salesmen The Genetic Edge Recombination Operator Proc of 3Rd Int. Conf on Genetic Algorithms, pp. 133-140, (1989)

← 1 2 3 4 →