2 ms·
This is a travelling salesman problem. It's true that a conventional computer cannot truly solve this problem for large size inputs because it is NP-hard. Wheth
by tialaramex 6y ago
This is a travelling salesman problem. It's true that a conventional computer cannot truly solve this problem for large size inputs because it is NP-hard. Whether the inputs for an actual scheduled aviation company are large enough to make this important I somewhat doubt, but regardless:
We have good heuristics for this problem which are very close to the likely best solution. So instead of an amazing pay off for a true solution you get in fact only a slight improvement or worse in some cases merely confirmation that your existing heuristic answer was actually the best possible.
- emteycz 6y agoCould you please point me to some of these alternative solutions?