Related papers: Jeep variants
The jeep problem was first solved by O. Helmer and N.J. Fine. But not much later, C.G. Phipps formulated a more general solution. He formulated a so-called convoy or caravan variant of the jeep problem and reduced the original problem to…
The $n$-vehicle exploration problem (NVEP) is a nonlinear unconstrained optimization problem. Given a fleet of $n$ vehicles with mid-trip refueling technique, the NVEP tries to find a sequence of $n$ vehicles to make one of the vehicles…
Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest. The diversity of applications has motivated the study of a myriad of problem…
We present a survey on several mass transportation problems, in which a given mass dynamically moves from an initial configuration to a final one. The approach we consider is the one introduced by Benamou and Brenier in [5], where a…
The paper addresses a variant of the Dial-A-Ride problem with additional features. It is referred to as the DARP with driver preferences, which attempts to determine a solution more driver-oriented by designing a short trip in a specific…
This paper introduces an extension to the Orienteering Problem (OP), called Clustered Orienteering Problem with Subgroups (COPS). In this variant, nodes are arranged into subgroups, and the subgroups are organized into clusters. A reward is…
Many real-world vehicle routing problems involve rich sets of constraints with respect to the capacities of the vehicles, time windows for customers etc. While in recent years first machine learning models have been developed to solve basic…
This paper introduces RouteFinder, a comprehensive foundation model framework to tackle different Vehicle Routing Problem (VRP) variants. Our core idea is that a foundation model for VRPs should be able to represent variants by treating…
The scheduling problem in Hurdle (1973) was formulated in a general form that simultaneously concerned the vehicle dispatching, circulating, fleet sizing, and patron queueing. As a constrained variational problem, it remains not fully…
In this article, we consider a multi-agent path planning problem in a partially impeded environment. The impeded environment is represented by a graph with select road segments (edges) in disrepair impeding vehicular movement in the road…
Generated Jacobian equations are Monge-Amp\`ere type equations which contain optimal transport as a special case. Therefore, optimal transport case has its own special structure which is not necessarily true for more general generated…
We define a new problem called the Vehicle Scheduling Problem (VSP). The goal is to minimize an objective function, such as the number of tardy vehicles over a transportation network subject to maintaining safety distances, meeting hard…
Decades after David Gale presented the concept of Chomp and S.-Y.R. Li produced his very first multiplayer model to investigate Multiplayer Nim, we hereby establish another Multiplayer Model to specifically analyze Chomp. Under such model,…
The Jacobian conjecture is thought to have been proposed by O. H. Keller in 1939. However, we have found that the statement of the conjecture is precisely the main result of a paper published by L. Kraus in 1884. Although the final step of…
The Vehicle Routing Problem (VRP) is a widely studied combinatorial optimization problem and has been applied to various practical problems. While the explainability for VRP is significant for improving the reliability and interactivity in…
We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover a set of ride requests while uncovered requests are assigned to other modes of transport (MOT). A car's route consists of one or…
We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each…
In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…