Related papers: Designing optimal networks for multi-commodity tra…
This study addresses the urban transit pattern design problem, optimizing stop sequences, headways, and fleet sizes across multiple routes and periods simultaneously to minimize user costs (composed of riding, waiting, and transfer times)…
This paper applies a discrete adjoint gradient computation method for a multi-class traffic flow model on road networks. Vehicle classes are characterized by their specific velocity functions, which depend on the total traffic density,…
Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable…
This paper studies the problem of optimal flow control in dynamic inventory systems. A dynamic optimal distribution problem, including time-varying supply and demand, capacity constraints on the transportation lines, and convex flow cost…
In this paper, we consider coordinated control of feeder vehicles for first and last mode transportation. The model is macroscopic with volumes of demands and supplies along with flows of vehicles. We propose a one-shot problem for…
Planning problems are hard, motion planning, for example, isPSPACE-hard. Such problems are even more difficult in the presence of uncertainty. Although, Markov Decision Processes (MDPs) provide a formal framework for such problems, finding…
A general nonlinear $1$st-order consensus-based solution for distributed constrained convex optimization is proposed with network resource allocation applications. The solution is used to optimize continuously-differentiable strictly convex…
We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. We seek to minimize the total elapsed…
Linear optimal power flow (LOPF) algorithms use a linearization of the alternating current (AC) load flow equations to optimize generator dispatch in a network subject to the loading constraints of the network branches. Common algorithms…
We introduce a tree-based formulation for the minimum-cost multi-commodity flow problem that addresses large-scale instances. The method decomposes the source-based model by representing flows as convex combinations of trees rooted at…
We study network properties of networks evolving in time based on optimal transport principles. These evolve from a structure covering uniformly a continuous space towards an optimal design in terms of optimal transport theory. At…
Highly-optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is non-convex and characterized by…
Supply chain management has been concentrated on productive ways to manage flows through a sophisticated vendor, manufacturer, and consumer networks for decades. Recently, energy and material rates have been greatly consumed to improve the…
In this thesis, Riemann problems and Godunov methods are developed for higher order traffic flow models. A rigorous analysis of the first order traffic flow model of inhomogeneous road is presented. A two-level simulation framework of…
Topology optimization (TopOpt) is a mathematical-driven design procedure to realize optimal material architectures. This procedure is often used to automate the design of devices involving flow through porous media, such as micro-fluidic…
High-tech giants and start-ups are investing in drone technologies to provide urban air delivery service, which is expected to solve the last-mile problem and mitigate road traffic congestion. However, air delivery service will not scale up…
Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to limit the mass transported between each pair of source and…
Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
Network flows often exhibit a hierarchical tree-like structure that can be attributed to the minimisation of dissipation. The common feature of such systems is a single source and multiple sinks (or vice versa). In contrast, here we study…