Multicommodity routing optimization for engineering networks

Abstract

Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions -- quantities determining the interaction between passengers -- in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers' fluxes by taking their sum or the sum of their squares. The first choice naturally reflects edges occupancy in transportation networks, however the second guarantees convergence to an optimal configuration of flows. Both modeling choices are applied to the Paris metro. We measure the extent of traffic bottlenecks and infrastructure resilience to node removal, showing that the two settings are equivalent in the congested transport regime, but different in the branched one. In the latter, the two formulations differ on how fluxes are distributed, with one function favoring routes consolidation, thus potentially being prone to generate traffic overload. Additionally, we compare our method to Dijkstra's algorithm to show its capacity to efficiently recover shortest-path-like graphs. Finally, we observe that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.

15 pages, 10 figures

References in corpus (6)

• Efficient routing on complex networks
• Interplay of river and tidal forcings promotes loops in coastal channel networks
• Optimal transport in multilayer networks for traffic flow optimization
• Infrastructure adaptation and emergence of loops in network routing with time-dependent loads
• Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
• Convergence properties of optimal transport-based temporal networks

Cited by in corpus (9)

• Urban transportation networks and optimal transport-based infrastructures: similarity and economy of scale
• Sustainable optimal transport in multilayer networks
• Cohesive urban bicycle infrastructure design through optimal transport routing in multilayer networks
• Bilevel Optimization for Traffic Mitigation in Optimal Transport Networks
• Infrastructure adaptation and emergence of loops in network routing with time-dependent loads
• Noise-induced network topologies
• Community Detection in networks by Dynamical Optimal Transport Formulation
• Immiscible Color Flows in Optimal Transport Networks for Image Classification
• Self-organized transport in noisy dynamic networks