Related papers: An ode to Phipps' jeep convoys
Traffic jam in a fluid model of traffic flows proposed by Kerner and Konh\"auser (B. S. Kerner and P. Konh\"auser, Phys. Rev. E 52 (1995), 5574.) is analyzed. An analytic scaling solution is presented near the critical point of the…
This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP). We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. k-…
Global solutions to the obstacle problem were first completely classified in two dimensions by Sakai using complex analysis techniques. Although the complex analysis approach produced a very succinct proof in two dimensions, it left the…
We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge depends on the ratio of the edge flow and the capacity…
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegative, symmetric travel times that satisfy the triangle…
In the book `What is Mathematics?' Richard Courant and Herbert Robbins presented a solution of a Whitney's problem of an inverted pendulum on a railway carriage moving on a straight line. Since the appearance of the book in 1941 the…
We introduce a new concept of solution to the KPZ equation which is shown to extend the classical Cole-Hopf solution. This notion provides a factorisation of the Cole-Hopf solution map into a "universal" measurable map from the probability…
We characterize the solution to the entropically regularized optimal transport problem by a well-posed ordinary differential equation (ODE). Our approach works for discrete marginals and general cost functions, and in addition to two…
In this paper, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser (1959), we are given a graph $G=(V,E)$ with metric edges costs, a depot…
The Vehicle Routing Problem with pickups, deliveries and spatiotemporal service constraints ($VRPPDSTC$) is a quite challenging algorithmic problem that can be dealt with in either an offline or an online fashion. In this work, we focus on…
We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models…
We introduce a new class of fine compactified Jacobians for nodal curves, that we call fine compactified Jacobians of vine type, or simply fine V-compactified Jacobians. This class is strictly larger than the class of fine classical…
We study a combinatorial problem inspired by the following scenario: fully autonomous vehicles drive on a multi-lane ($m \geq 2$) road. Each vehicle heads to its own destination and is allowed to exit the road only through a single…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
The work of the first author on the moment map for representations of quivers included a classification of the possible dimension vectors of simple modules for deformed preprojective algebras. That classification was later used to solve an…
Filterless optical transport networks relies on passive optical interconnections between nodes, i.e., on splitters/couplers and amplifiers. While different studies have investigated their design, none of them offer a solution for an optimal…
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical…
We propose a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the…
The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one of the core and most studied problems in supply chain management for the last half a century. Nonetheless, despite the vast effort put into studying the problem, its…
This thesis introduces stochastic generalized routing problem model and proposes exact and heuristic algorithms to solve it efficiently, in a wide range of problem sizes. At first, the classic routing problem with its common variations in…