A hybrid approach for a constrained routing problem

Regarding the solution of combinatorics problems, is important to evaluate the cost and the benefit among obtaining solutions of high quality in detriment of the computational resources required. The problem presented is about the routing of a vehicle with pickup and delivery of product with time window constraints. This problem requires to be attended with instances of great scale (nodes≥100). We have a large quantity of nodes with restrictions of time windows (≥90%) and with a large factor of amplitude (≥75%) as well. The problem is NP-hard and for such motive the application of an exact method of solution to resolve it, is limited by the practical time for routing. This paper proposes a specialized genetic algorithm, which offers solutions of good quality in computational times that do useful its application.