Traffic flow is modeled by a conservation law describing the density of cars. It isassumed that each driver chooses his own departure time in order to minimize the sum of adeparture and an arrival cost. There are N groups of drivers, Thei-th group consists of κidrivers, sharing the same departure and arrival costsϕi(t),ψi(t).For any given population sizesκ1,...,κn,we prove the existence of a Nash equilibrium solution, where no driver can lower his owntotal cost by choosing a different departure time. The possible non-uniqueness, and acharacterization of this Nash equilibrium solution, are also discussed.