What do heuristic algorithms mean?

The heuristic algorithm (heuristic algorithm) is presented relative to the optimization algorithm. An optimal algorithm of a problem is obtained for the optimal solution of each instance of the problem. Heuristic algorithm can be defined as: An algorithm based on an intuitive or empirical structure, in the acceptable cost (referring to computational time and space) to solve the combinatorial optimization problem of each instance of a feasible solution, the feasible solution and the degree of deviation of the optimal solution is generally not expected.

The two basic objectives of computer science are to find an algorithm which can prove that it performs well and can get the best solution or sub-optimal solution. The heuristic algorithm attempts to provide one or all of the targets at a time. For example, it can often find a good solution, but there is no way to prove that it does not get the worse solution, it can usually solve the answer in a reasonable time, but there is no way to know whether it can be solved at this speed every time.

What do heuristic algorithms mean?