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.

Meeting Name

International Conference on Intelligent Sensing and Information Processing, 2004


Electrical and Computer Engineering

Keywords and Phrases

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

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type





© 2004 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jan 2004