Evolutionary Algorithms, Markov Decision Processes, Adaptive Critic Designs, and Clustering: Commonalities, Hybridization and Performance
This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/1607
There were 7 downloads as of 28 Jun 2016.
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.
