𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Max problem revisited: The importance of mutation in genetic programming

✍ Scribed by Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O'Reilly, Una-May

Book ID
121946658
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
861 KB
Volume
545
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming and a max-min proble
Dynamic programming and a max-min problem in the theory of structures
✍ Nestor Distefano 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A max-min problem in the realm of optimum beam design is formulated and thoroughly investigated from a dynamic programming point of view. It is shown that the conditions of optimality can be directly derived from the Hamilton-Jacobi-Bellman equation of the process. The classical Euler-Lagrange equat

The efficiency of hybrid mutation geneti
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem
✍ K Katayama; H Sakamoto; H Narihisa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 519 KB

In this paper, we present an efficient genetic algorithm (GA) for solving the travelling salesman problem (TSP) as a combinatorial optimization problem. In our computational model, we propose a complete subtour exchange crossover that does not break as some good subtours as possible, because the goo