Đang chuẩn bị liên kết để tải về tài liệu:
Evolutionary algorithms

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

In the chapter limit properties of genetic algorithms and theproblem of their classification are elaborated. Recently one can observe an increasing interest in properties of genetic algorithms modelled by Markov chains (Vose, Rowe). However, the known results are mainly limited to existence theorems. They say that there exists a limit distribution for a Markov chain describing a simple genetic algorithm. In the chapter we perform the next step on this way and present a formula for this limit distribution for a Markov chain. Moreover, we claim that our convergence theorems can be extended to algorithms which admit the change in the mutation rate and others parameters