I am trying to find a heuristic to solve a travel salesman problem but with more restrictions. Using the greedy is giving me a total cost of 3.839. Using A* with some estimation as a heuristic is giving me results of 4.0 to 5.35. Using A* while using greedy as a heuristic gives me the best result of 3.5.
Is this wrong? Using a greedy method as a heuristic for a A* algorithm? Does this fall under the category of non-optimistic? Meaning that It can't be used as a heuristic?
ps: this is a graph with many restrictions, with about 5 metrics, so I can't just calculate a distance to the final point.