Genetic algorithm for a vehicle routing problem with pickup & delivery with time window constraints

Regarding the solution of combinatorics problems is important to evaluate the cost and benefit among solutions of high quality versus 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). A strong active time window exists (>= 90%) with a large factor of amplitude (>= 75%). The problem is NP-hard and for such motive the application of an exact method of solution to resolve it, is limited by the time required for the activity of routing. It is proposed a specialized genetic algorithm, which offers solutions of good quality in computational times that do useful its application.