In this paper an heuristic algorithm is developed Its implementation is developedas well  in order to solve a sampling problem in the urban transportation network in Mexico City The problem consist of the selection of at least 2 points (stops) on each ofthe 236 routes in the study comprising a total of 8390 stops