Implement the Travelling salesman problem
Mostrar comentarios más antiguos
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
3 comentarios
John D'Errico
el 31 de Mzo. de 2018
What version of MATLAB do you have? I would conjecture that you are using an older MATLAB release, that is too old to support what you tried to do.
Stefan Zeiter
el 31 de Mzo. de 2018
Stefan Zeiter
el 31 de Mzo. de 2018
Respuesta aceptada
Más respuestas (1)
Alan Weiss
el 2 de Abr. de 2018
0 votos
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
Categorías
Más información sobre Nearest Neighbors en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!