The Vehicle Routing Problem with Time Windows has become a pretty studied optimization problem. Because the time constraint greatly expands the possible solutions; this allow that the model get closer to reality. In this investigation, the restrictions, the conclusions and future works of around two hundred papers, have been consulted at Web of Science, Scopus and Sage. In these, the most widely used bioinspired metaheuristic algorithms were analyzed to provide solutions in the vehicle routing problem with time windows. The objective of this research is the publication of an article, which serves as a reference or support to give a broad documented vision to future research on Bioinspired Metaheuristics. The findings about them: Few written evidence it found about periodic restriction, and only some papers, involving heterogeneous fleets. From the perspective of metaheuristic techniques, the algorithms that has been most used for solve this problem, are the genetic algorithms. In addition, little information was found on the application of the Buffalo and Cuckoo algorithms. Which can become a great opportunity for new research in this field. Based on these findings, it can be concluded that the application of hybrid algorithms, could be analyzed in depth. Because there is little information, and this represents a wide and interesting spectrum of research, which can be used to increase solutions in these problems.