Related papers: An ode to Phipps' jeep convoys
We consider the speed planning problem for a vehicle moving along an assigned trajectory, under maximum speed, tangential and lateral acceleration, and jerk constraints. The problem is a nonconvex one, where nonconvexity is due to jerk…
We construct big generalized Heegner classes by interpolating $p$-adically the generalized Heegner classes associated to quaternionic modular forms along a Coleman (finite slope) family, following the approach introduced by…
Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints. While recent neural methods excel in constructing solutions based on feasibility masking, they struggle with handling complex…
Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed…
This paper introduces a new generic problem to the literature of Workforce Scheduling and Routing Problem. In this problem, multiple workers are assigned to a shared vehicle based on their qualifications and customer demands, and then the…
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 Capacitated Arc Routing Problem (CARP), introduced by Golden and Wong in 1981, is an important arc routing problem in Operations Research, which generalizes the famous Capacitated Vehicle Routing Problem (CVRP). When every customer has…
This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…
We give a sharply-vertex-transitive solution of each of the nine Hamilton-Waterloo problems left open by Danziger, Quattrocchi and Stevens.
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of special structure. We observe that the…
The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry. This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and…
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We…
We prove that the solution of the discounted approximation of a degenerate viscous Hamilton--Jacobi equation with convex Hamiltonians converges to that of the associated ergodic problem. We characterize the limit in terms of stochastic…
In this paper, we study novel variants of the well-known two-echelon vehicle routing problem in which a truck works on the first echelon to transport parcels and a fleet of drones to intermediate depots while in the second echelon, the…
The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the $n$-vehicle exploration problem is proved to be NP-complete (arXiv:2304.03965v1, The $n$-vehicle exploration problem is…
Entropic regularization provides a generalization of the original optimal transport problem. It introduces a penalty term defined by the Kullback-Leibler divergence, making the problem more tractable via the celebrated Sinkhorn algorithm.…
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 classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
The classic result by Fortune, Hopcroft, and Wyllie [TCS~'80] states that the directed disjoint paths problem is NP-complete even for two pairs of terminals. Extending this well-known result, we show that the directed disjoint paths problem…