Traffic management and route guidance are optimization problems by nature. In this article, we consider algorithms for centralized route guidance and discuss fairness aspects for the individual user resulting from optimal route guidance policies. The first part of this article deals with the mathematical aspects of these optimization problems from the viewpoint of network flow theory. We present algorithms which solve the constrained multicommodity minimum cost flow problem (CMCF) to optimality. A feasible routing is given by a flow x, and the cost of flow x is the total travel time spent in the network. The corresponding optimum is a restricted system optimum with a globally controlled constrained or fairness factor L > 1. This approach im...
When traffic flows are routed through a road network it is desirable to minimize the total road usag...
Planning optimal routes for Autonomuos Guided Vehicle transport systems is a crucial task for improv...
Part 18: Optimization in Collaborative NetworksInternational audienceThe goal of the paper is to dem...
Traffic management and route guidance are optimization problems by nature. In this article, we consi...
The design of route-guidance systems faces a well-known dilemma. The approach that theoretically yie...
In this paper we study the problem of the assignment of road paths to vehicles. Due to the assumpti...
In this paper we study the problem of the assignment of road paths to vehicles. If we assume availa...
This paper focuses on two commonly used path assignment policies for agents traversing a congested n...
Dynamic congestion pricing is a useful tool not only to mitigate traffic congestion but also to infl...
Fair allocation of flows in multicommodity networks has been attracting a growing attention. In Max-...
When traffic flows are routed through a road network it is desirable to minimize the total road usag...
Some traffic management measures route drivers towards socially-desired paths in order to achieve th...
This work investigates the joint optimization problem of demand management and route guidance to min...
We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since...
When traffic flows are routed through a road network it is desirable to minimize the total road usag...
Planning optimal routes for Autonomuos Guided Vehicle transport systems is a crucial task for improv...
Part 18: Optimization in Collaborative NetworksInternational audienceThe goal of the paper is to dem...
Traffic management and route guidance are optimization problems by nature. In this article, we consi...
The design of route-guidance systems faces a well-known dilemma. The approach that theoretically yie...
In this paper we study the problem of the assignment of road paths to vehicles. Due to the assumpti...
In this paper we study the problem of the assignment of road paths to vehicles. If we assume availa...
This paper focuses on two commonly used path assignment policies for agents traversing a congested n...
Dynamic congestion pricing is a useful tool not only to mitigate traffic congestion but also to infl...
Fair allocation of flows in multicommodity networks has been attracting a growing attention. In Max-...
When traffic flows are routed through a road network it is desirable to minimize the total road usag...
Some traffic management measures route drivers towards socially-desired paths in order to achieve th...
This work investigates the joint optimization problem of demand management and route guidance to min...
We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since...
When traffic flows are routed through a road network it is desirable to minimize the total road usag...
Planning optimal routes for Autonomuos Guided Vehicle transport systems is a crucial task for improv...
Part 18: Optimization in Collaborative NetworksInternational audienceThe goal of the paper is to dem...