Temps d'attente dans les transports urbains en commun
The inverse carrier problem
The problem was motivated by Borůvka’s definitions of the carrier and the associated carrier. The inverse carrier problem is precisely defined and partially solved. Examples are given.
The Procedure to Determine Microstate Probabilities in a Trunk Group Serving Overflow Traffic
The vehicle routing problem
Traffic plans.
In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...