Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Evolutionary algorithms, Markov decision processes, adaptive critic designs, and clustering: commonalities, hybridization and performance | |
| Author (s): | Wunsch, Donald C. Mulder, S. | |
| Department/Lab Affiliations: | Applied Computational Intelligence Laboratory Electrical and Computer Engineering | |
| Keywords: | Markov decision process Markov processes adaptive critic design chained Lin Kernighan algorithm divide and conquer methods evolutionary algorithms evolutionary computation traveling salesman problem travelling salesman problems | |
| Issue Date: | 2004 | |
| Publisher: | Institute of Electrical and Electronics Engineers | |
| Citation: | Wunsch, D.C., II; Mulder, S., "Evolutionary algorithms, Markov decision processes, adaptive critic designs, and clustering: commonalities, hybridization and performance," Proceedings of International Conference on Intelligent Sensing and Information Processing, pp. 477- 482, 2004 | |
| Abstract: | We briefly review and compare the mathematical formulation of Markov decision processes (MDP) and evolutionary algorithms (EA). In so doing, we observe that the adaptive critic design (ACD) approach to MDP can be viewed as a special form of EA. This leads us to pose pertinent questions about possible expansions of the methodology of ACD. This expansive view of EA is not limited to ACD. We discuss how it is possible to consider the powerful chained Lin Kernighan (chained LK) algorithm for the traveling salesman problem (TSP) as a degenerate case of EA. Finally, we review some recent TSP results, using clustering to divide-and-conquer, that provide superior speed and scalability. | |
| Type: | Article - Conference proceedings text | |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: | |
| Publisher URL: | ||
| Link to this page: | ||
| Full Text: |
|
| title | Evolutionary algorithms, Markov decision processes, adaptive critic designs, and clustering: commonalities, hybridization and performance | |
| contributor.author | Wunsch, Donald C. | |
| contributor.author | Mulder, S. | |
| contributor.deptlab | Applied Computational Intelligence Laboratory | |
| contributor.deptlab | Electrical and Computer Engineering | |
| subject | Markov decision process | |
| subject | Markov processes | |
| subject | adaptive critic design | |
| subject | chained Lin Kernighan algorithm | |
| subject | divide and conquer methods | |
| subject | evolutionary algorithms | |
| subject | evolutionary computation | |
| subject | traveling salesman problem | |
| subject | travelling salesman problems | |
| date.issued | 2004 | |
| date.submitted | 2007 | |
| publisher | Institute of Electrical and Electronics Engineers | |
| identifier.citation | Wunsch, D.C., II; Mulder, S., "Evolutionary algorithms, Markov decision processes, adaptive critic designs, and clustering: commonalities, hybridization and performance," Proceedings of International Conference on Intelligent Sensing and Information Processing, pp. 477- 482, 2004 | |
| identifier.pub.URI | ||
| description.abstract | We briefly review and compare the mathematical formulation of Markov decision processes (MDP) and evolutionary algorithms (EA). In so doing, we observe that the adaptive critic design (ACD) approach to MDP can be viewed as a special form of EA. This leads us to pose pertinent questions about possible expansions of the methodology of ACD. This expansive view of EA is not limited to ACD. We discuss how it is possible to consider the powerful chained Lin Kernighan (chained LK) algorithm for the traveling salesman problem (TSP) as a degenerate case of EA. Finally, we review some recent TSP results, using clustering to divide-and-conquer, that provide superior speed and scalability. | |
| type | Article - Conference proceedings | |
| type.DCMIType | text | |
| type.status | Final version | |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | |
| rights.URI | ||
| date.accessioned | 2007-04-05T14:19:35Z | |
| date.available | 2007-04-05T14:19:34Z | |
| identifier.persist.URI | ||
| Full Text |
|