我要解决的TSP与分支定界算法。
I'm trying to solve the TSP with branch and bound algorithm.
我必须bulid成本矩阵,但我有一个很大的问题。 我有城市坐标x和y。
I'm must bulid a matrix with cost but i have one big problem. I have city with coordinates x and y.
旅行的成本为 CEIL(CEIL(开方((X1-X2)^ 2 +(Y1-Y2)^ 2))/ V)
+天市。
V是速度。
The cost of travel is ceil(ceil(sqrt((x1-x2)^2+(y1-y2)^2))/v)
+ days in city.
V is speed.
在市天取决于从第一天当W来到城市。 例如,当我们到达周一(T1)城市1.我们住9天却当我们到达周二我们留在城市的4天。
Days in city depend from day when w come to city. For example when we arrived on Monday(t1) to city 1. we stay 9 days but when we arrived on tuesday we stay in city 4 days.
x y t1 . t7
city 1. 79 -36 9 4 8 5 5 7 8
city 2. 8 67 6 9 2 1 9 9 1
city 3. 29 57 7 5 10 8 10 9 4
采用分支定界算法我
如何才能解决这个问题呢?
How can i solve this problem using branch and bound algorithm?
推荐答案
在这里你去:的 http://lcm.csa.iisc.ernet.in/dsa/node187.html - 这似乎可以解释得相当好这个应该怎么走近
Here you go: http://lcm.csa.iisc.ernet.in/dsa/node187.html - it seems to explain fairly well how this should be approached.
相关推荐
最新文章