Related papers: An APX for the Maximum-Profit Routing Problem with…
In many applications of vehicle routing, a set of time windows are feasible for each visit, giving rise to the Vehicle Routing Problem with Multiple Time Windows (VRPMTW). We argue that such disjunctions are problematic for many solution…
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial $\frac…
Conflict-Free Vehicle Routing Problems (CF-VRPs) arise in manufacturing, transportation and logistics facilities where Automated Guided Vehicles (AGVs) are utilized to move loads. Unlike \textit{Vehicle Routing Problems} arising in…
The rapid growth of online retail and e-commerce has made effective and efficient Vehicle Routing Problem (VRP) solutions essential. To meet rising demand, companies are adding more depots, which changes the VRP problem to a complex…
Instant food delivery has become one of the most popular web services worldwide due to its convenience in daily life. A fundamental challenge is accurately predicting courier routes to optimize task dispatch and improve delivery efficiency.…
The stochastic shortest path problem (SSPP) asks to resolve the non-deterministic choices in a Markov decision process (MDP) such that the expected accumulated weight before reaching a target state is maximized. This paper addresses the…
Multi-vehicle routing has become increasingly important with the rapid development of autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to…
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…
We consider the vehicle routing problem with stochastic demands (VRPSD), a stochastic variant of the well-known VRP in which demands are only revealed upon arrival of the vehicle at each customer. Motivated by the significant recent…
We study real-time routing policies in smart transit systems, where the platform has a combination of cars and high-capacity vehicles (e.g., buses or shuttles) and seeks to serve a set of incoming trip requests. The platform can use its…
We present a compact mixed integer program (MIP) for the backhaul profit maximization problem in which a freight carrier seeks to generate profit from an empty delivery vehicle's backhaul trip from its last scheduled delivery to its depot…
This study explores the potential of using ride-hailing vehicles (RVs) for integrated passenger and freight transport based on shared mobility. In this crowd-sourced mode, ride-hailing platforms can profit from parcel delivery services, and…
Mobility-on-demand (MoD) ridesharing is a promising way to improve the occupancy rate of personal vehicles and reduce traffic congestion and emissions. Maximizing the number of passengers served and maximizing a profit target are major…
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days, considering the wide usage of routing algorithms in multiple fields such as transportation domain, food delivery, network routing,…
We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) for both unweighted and weighted terrains, which aims to minimize the coverage time, defined as the maximum travel time of all robots. Specifically, we focus on a…
This paper considers an unmanned vehicle-robot pickup and delivery system, in which a self-driving vehicle carrying multiple unmanned robots in the form of the mother ship travels from a depot to a number of stations distributed in a…
Vehicle Routing Problems (VRP) are an extension of the Traveling Salesperson Problem and are a fundamental NP-hard challenge in combinatorial optimization. Solving VRP in real-time at large scale has become critical in numerous…
We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside our control, such as…
The Multi-Commodity Pickup and Delivery Vehicle Routing Problem aims to optimize the pickup and delivery of multiple unique commodities using a fleet of several agents with limited payload capacities. This paper addresses the challenge of…
Multi-depot vehicle routing problems (MDVRPs) are prevalent in a variety of practical applications. However, they are computationally challenging to solve due to their inherent complexity. This paper proposes an effective hybrid algorithm…