markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm

The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are fixed and unchangeable for the next times. a discrete time markov chain is established in on-line policy times. then, the best state is selected to traverse the next node by a simulated annealing heuristic.