A computer implemented method for traffic flow simulation so as to determine a traffic volume on route sections in a traffic network, said method being performed on a digital data processing unit on the basis of: • a traffic network as a graph of route sections and nodes, • wherein a first set of nodes are starting places and each starting place is allocated a starting place number of traffic participants, and a second set of nodes are destinations; wherein it is not predetermined which destination a specific traffic participant travels to from his starting place, and in order to determine a traffic volume of route sections a dispersion is applied in which each separate traffic participant is dispersed from a starting place to the possible destinations, and a corresponding traffic participant fraction that is allocated to a specific destination respectively is equal to a destination weighting factor that is allocated to this destination divided by the number of destinations, and the traffic participant fraction is dispersed over the optimal paths to all possible destinations by performing the following steps: • for each starting place and for each of the traffic participants of the starting place: o determining allocated to each of the destinations respectively a traffic participant fraction, corresponding to an allocation of the traffic participants to the destinations; o determining allocated to each of the destinations respectively an optimal route from the starting place to the destination; o determining for each of the destinations and for each route section of the optimal route a dwell portion of the traffic participant in the route section as a function of the traffic participant fraction that is allocated to this destination; • for each of the route sections of the traffic network: o determining the traffic volume on the route section by means of summating the dwell portions of all traffic participants in this route section. • a traffic network as a graph of route sections and nodes, • wherein a first set of nodes are starting places and each starting place is allocated a starting place number of traffic participants, and a second set of nodes are destinations; • for each starting place and for each of the traffic participants of the starting place: o determining allocated to each of the destinations respectively a traffic participant fraction, corresponding to an allocation of the traffic participants to the destinations; o determining allocated to each of the destinations respectively an optimal route from the starting place to the destination; o determining for each of the destinations and for each route section of the optimal route a dwell portion of the traffic participant in the route section as a function of the traffic participant fraction that is allocated to this destination; o determining allocated to each of the destinations respectively a traffic participant fraction, corresponding to an allocation of the traffic participants to the destinations; o determining allocated to each of the destinations respectively an optimal route from the starting place to the destination; o determining for each of the destinations and for each route section of the optimal route a dwell portion of the traffic participant in the route section as a function of the traffic participant fraction that is allocated to this destination; • for each of the route sections of the traffic network: o determining the traffic volume on the route section by means of summating the dwell portions of all traffic participants in this route section. o determining the traffic volume on the route section by means of summating the dwell portions of all traffic participants in this route section.