first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
Convergence of a New Evolutionary Computing Algorithm in Continuous State Space
Authors:
Chuan-Long Wang;
Ke-Ming Xie a
| Affiliation: | a The Research Center of Science College, Xi'an Jiaotong University, Xi'an 710049. |
DOI:
10.1080/00207160211915
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
1
2002
, pages 27
- 37
International Journal of Computer Mathematics,
Volume
79,
Issue
1
2002
, pages 27
- 37
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 8
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
A Markov chain on a new evolutionary computing algorithm is analyzed in continuous state space. By establishing transition probability density, the convergence of the similartaxis operator is proved. Meanwhile, the local property of the similartaxis operator is shown. To avoid its prematurity, a dissimilation operator need to be introduced. With the concept of P-absorbing field and P-optimal state, the convergence of the dissimilation operator is proved. We apply this new algorithm to a difficult problem for the accurate mixture ratio of raw materials of cement processing and make a comparison between GAs and the new algorithm. Finally, the functions of similartaxis and dissimilation operators are analyzed in a practical view.
|
| Keywords: Evolutionary Algorithm; Similartaxis Operator; Dissimilation Operator; Continuous Space; Convergence |
| view references (8) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
