DMCA
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts - Towards Memetic Algorithms (1989)
| Citations: | 238 - 10 self |
BibTeX
@MISC{Moscato89onevolution,,
author = {Pablo Moscato},
title = {On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts - Towards Memetic Algorithms},
year = {1989}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Short abstract, isn't it? P.A.C.S. numbers 05.20, 02.50, 87.10 1 Introduction Large Numbers "...the optimal tour displayed (see Figure 6) is the possible unique tour having one arc fixed from among 10 655 tours that are possible among 318 points and have one arc fixed. Assuming that one could possibly enumerate 10 9 tours per second on a computer it would thus take roughly 10 639 years of computing to establish the optimality of this tour by exhaustive enumeration." This quote shows the real difficulty of a combinatorial optimization problem. The huge number of configurations is the primary difficulty when dealing with one of these problems. The quote belongs to M.W Padberg and M. Grotschel, Chap. 9., "Polyhedral computations", from the book The Traveling Salesman Problem: A Guided tour of Combinatorial Optimization [124]. It is interesting to compare the number of configurations of real-world problems in combinatorial optimization with those large numbers arising in Cosmol...
Keyphrases
genetic algorithm martial art towards memetic algorithm combinatorial optimization p.a.c.s. number exhaustive enumeration primary difficulty huge number traveling salesman problem real difficulty optimal tour displayed large number quote belongs real-world problem polyhedral computation possible unique tour guided tour short abstract combinatorial optimization problem m.w padberg introduction large number
