How to solve a large-scale travel salesman problem by properly setting options?

3 views (last 30 days)
I just follow the tutorial https://www.mathworks.com/help/optim/ug/travelling-salesman-problem.html to solve the TSP problem by using intlinprog. The problem is that my actual problem will be a large size problem with around 3000 cities. Therefore, I just tried several suggestion, according to https://www.mathworks.com/help/optim/ug/tuning-integer-linear-programming.html but doesn't manage to find a solution(it will timeout after 2 hours). Given this situation(speed is more favorable than global shortest path), can I find an approximate solution within a practicable time by somehow setting a proper option?

Answers (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!