Implement the Travelling salesman problem
6 次查看(过去 30 天)
显示 更早的评论
Hey
I would like to implement the branch and bound algorithm to solve the TSP. For achieving this task I found good inputs at this website: https://ch.mathworks.com/help/optim/examples/travelling-salesman-problem.html
Attached you can find my script. At the moment I get following error message:
>> TSP Error using optim.problemdef.OptimizationProblem/solve options is not a valid solver. Use 'linprog' or 'intlinprog' instead.
Error in TSP (line 71) tspsol = solve(tsp,'options',opts)
Could someone help me to solve this problem? I don't know where is the fault. I have also an additional question. Is my script working with the branch and bound algorithm? I would guess so because the scripts contains constraints and subconstraints. But I'm not sure...
Best
采纳的回答
John D'Errico
2018-3-31
编辑:John D'Errico
2018-3-31
Your problem is here:
tspsol = solve(tsp,'options',opts)
which should be:
tspsol = solve(tsp,opts)
tspsol =
struct with fields:
trips: [19900×1 double]
As you can see, my release (also R2017b) has no problem.
3 个评论
John D'Errico
2018-4-1
NO. You do NOT define a variable named updateSalesmanPlot. That is expected to be a function. When you created it as a variable, it tries to index into the variable, instead of calling a function by that name.
更多回答(1 个)
Alan Weiss
2018-4-2
From the example that you mentioned click the "Try this example" button in MATLAB (not in your browser). This will take your MATLAB to the appropriate folder, containing the updateSalesmanPlot function, so MATLAB can find it.
Alan Weiss
MATLAB mathematical toolbox documentation
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Traveling Salesman (TSP) 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!