An evolutionary approach for a topologic constrained routing problem

Our problem is about a routing of a vehicle with pickup and delivery of product with time window constraints. This problem requires to be attended with instances of medium scale (nodes≥100). A strong active time window exists (≥90%) with a large factor of amplitude (≥75%). This problem is NP-hard and for such motive the application of an exact method is limited by the computational time. This paper proposes a specialized genetic algorithm. We report good solutions in computational times below 5 minutes. The previous finding allows its application in business environment where the decision time is critical.