In previous entries we saw there are cases in which Integer Linear Programming is not the most appropriate approach to solve routing problems, and we proposed the option of using metaheuristic algorithms to obtain feasible solutions, and in many cases close to the optimal solution.

As already mentioned in this blog, integer linear programming is often not useful in the real world to find the optimal solution to routing problems.One of the most common metaheuristic techniques to solve this problem is known as Ant Colony Optimisation (ACO).

In recent years, many times I have had to argue that the using Linear and Integer Linear Programming was not the most appropriate one to solve routing problems. This is not an absolute truth, although it is true that it makes quite a bit of sense as a general rule.