Related papers: Jeep variants
It is well-known that the optimal transport problem on the real line for the classical distance cost may not have a unique solution. In this paper we recover uniqueness by considering the transport problems where the costs are a power…
By disintegration of transport plans it is introduced the notion of transport class. This allows to consider the Monge problem as a particular case of the Kantorovich transport problem, once a transport class is fixed. The transport problem…
In general, there are two kinds of cooperative driving strategies, planning based strategy and ad hoc negotiation based strategy, for connected and automated vehicles (CAVs) merging problems. The planning based strategy aims to find the…
We address the problem of optimal path planning for a simple nonholonomic vehicle in the presence of obstacles. Most current approaches are either split hierarchically into global path planning and local collision avoidance, or neglect some…
The hodograph, i.e. the path traced by a body in velocity space, was introduced by Hamilton in 1846 as an alternative for studying certain dynamical problems. The hodograph of the Kepler problem was then investigated and shown to be a…
We study a multi-marginal optimal transport problem with surplus $b(x_{1}, \ldots, x_{m})=\sum_{\{i,j\}\in P} x_{i}\cdot x_{j}$, where $P\subseteq Q:=\{\{i,j\}: i, j \in \{1,2,...m\}, i \neq j\}$. We reformulate this problem by associating…
Klein and Williams developed an obstruction theory for the homotopical equivariant fixed point problem, which asks whether an equivariant map can be deformed, through an equivariant homotopy, into another map with no fixed points…
In the first part of the paper we briefly decribe the classical problem, raised by Monge in 1781, of optimal transportation of mass. We discuss also Kantorovich's weak solution of the problem, which leads to general existence results, to a…
The Vehicle Routing Problem (VRP) is a fundamental challenge in logistics management research, given its substantial influence on transportation efficiency, cost minimization, and service quality. As a combinatorial optimization problem,…
We provide an affirmative answer to a variant of the Busemann-Petty problem, proposed by V.~Milman: Let $K$ be a convex body in ${\mathbb R}^n$ and let $D$ be a compact subset of ${\mathbb R}^n$ such that, for some $1\ls k\ls n-1$,…
The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes (TOP-ST-MIN) is a variant of the classic Team Orienteering Problem (TOP), which includes three novel features that stem from two real-world problems…
The problem of the longest head run was introduced and solved by Abraham de Moivre in the second edition of his book Doctrine of Chances (de Moivre, 1738). The closed-form solution as a finite sum involving binomial coefficients was…
Routing problems are often faced by companies who serve costumers through vehicles. Such problems have a challenging structure to optimize, despite the recent advances in combinatorial optimization. The goal of this project is to study and…
The ridesharing problem is that given a set of trips, each trip consists of an individual, a vehicle of the individual and some requirements, select a subset of trips and use the vehicles of selected trips to deliver all individuals to…
In order to keep a green planet, in particular its important to limiting the pollution with gas emissions. In a specific capacitated fixed-charge transportation problem with fixed capacities for distribution centers and customers with…
In most Swiss municipalities, a curbside system consisting of heavy trucks stopping at almost each household is used for non-recoverable waste collection. Due to the many stops of the trucks, this strategy causes high fuel consumption,…
Due to the intricate of real-world road topologies and the inherent complexity of autonomous vehicles, cooperative decision-making for multiple connected autonomous vehicles (CAVs) remains a significant challenge. Currently, most methods…
We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed. The goal is to determine the expected number of group…
Route planning for a fleet of vehicles is an important task in applications such as package delivery, surveillance, or transportation, often integrated within larger Intelligent Transportation Systems (ITS). This problem is commonly…
We make progress on a generalization of the road (colouring) problem. The road problem was posed by Adler-Goodwyn-Weiss and solved by Trahtman. The generalization was posed, and solved in certain special cases, by Ashley-Marcus-Tuncel. We…