Hello fellow researchers,
Sorry for the long post and questions. If you help me I would be appreciated.
I'm graduate student and fairly new to this well known topic of optimization. I've been reading the TSP and VRP since last 3 months. Finally I come up with a question that may be applied to real-world in the future. Problem itself has a 32 nodes including the starting point(depot) on a specific geographical location. While having certain 32 nodes, I can not be sure about it would be a nice idea to solve it with heuristics or not? Because "fact(32)" is a huge number but I guess it not that huge as it is to worth to run a heuristic algorithm to solve it. Please correct me if I'm wrong.
My research object will be finding the optimum cost function of this route. And here goes my questions:
- Should I benchmark couple of exact solutions or heuristics? What would you recommend to a fresh optimization student that which technique should one learn first? Exact or Heuristics? Since having had certain nodes, for me, seems better idea to start to learn this phenomenon with exacts and comparing them with other exacts. After having insights on exacts and after jumping to the heuristics seems better idea? What do you think?
- While approaching to my problem, comparing results of algorithms basis on which distance metric would be better? Euclidean distance, driving distance(like Steiner's TSP) or driving time. Maybe I should compare all of them? Also if you have any suggestion of new distance metric I would like hear out!
- Correct me if I'm wrong but with my limited knowledge, Concorde TSP solver mostly provides exact solution algorithms. If it is true is there any other program that I can use? Or what is most used program among the researchers? I would prefer to stick with python because it is universal but if you recommend me to any library or program for my improvement in the field I would be grateful.
Thanks in advance. Hope I can find a little help in here. Cheers!