A diffrent kind of travelling salesman problem

[meandmyself]

A person at the centre of a circle needs to tarvel to 5 cities on the

circumfarance of the circle. Each city has 5 gates that allow him/her to

get through to the city. There is a charge involved when going through

each gate. Furthermore, after going through a gate, the charge on all the

other gates change (ie they are dynamic). The person is aware of the

resulting change in charge by going through a gate, BEFORE entering it. I

hope I haven't confused you too much!.

 

I'd like to know your thoughts on this problem. How you would approach a

problem like this. A possible matrix???? See it differs from the coonventional TSP problem by the fact that the charges on the gates are dynamic. Apparently the optimization theory will need to be used. Anyone familiar with this?

 

Thanks

[DQW]

This looks like a doable Dynamic Programming problem. Have a look into DP. Come back if you have questions. It's been ages since I solved a DP problem, but who knows, something might come back to me.