The problem of waste collection is part of the problem of optimizing the routes taken by vehicles to meet the need for transport of waste between collection points and final storage. It is a question of determining a circuit of several vehicles, so as to serve at a lower cost a set of collection points distributed in a network. That is, designing a set of visits, from the same repository, through a set of predefined collection points (nodes). We propose a resolution of the genetic algorithm to minimize the total cost of transportation which is proportional to the total distance. We tested the efficiency of our algorithm under Matlab R2014a.