相关论文: Solving the Team Orienteering Problem with Cutting…

The Team Orienteering Problem (TOP) is an NP-hard routing problem in which a fleet of identical vehicles aims at collecting rewards (prizes) available at given locations, while satisfying restrictions on the travel times. In TOP, each…

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…

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…

We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance…

Many municipalities and large organizations have fleets of vehicles that need to be coordinated for tasks such as garbage collection or infrastructure inspection. Motivated by this need, this paper focuses on the common subproblem in which…

We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given limited time budget. Different from most existing works where…

In this paper we tackle the Team Orienteering Problem with Service Times, Mandatory Nodes and Incompatibilities, introduced in~\cite{Guastalla2024} and arising from two real-world healthcare applications. We propose two heuristic algorithms…

We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates…

Finding the Time-Optimal Parameterization of a Path (TOPP) subject to second-order constraints (e.g. acceleration, torque, contact stability, etc.) is an important and well-studied problem in robotics. In comparison, TOPP subject to…

Coordinating the motion of multiple robots in cluttered environments remains a computationally challenging task. We study the problem of minimizing the execution time of a set of geometric paths by a team of robots with state-dependent…

Temporal dependencies between customer visits, such as synchronization constraints, pose a fundamental challenge in vehicle routing. These dependencies, which arise in applications such as home healthcare routing, aircraft scheduling, and…

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…

We develop an approach for solving rooted orienteering problems with category constraints as found in tourist trip planning and logistics. It is based on expanding partial solutions in a systematic way, prioritizing promising ones, which…

The cutting plane method is a key technique for successful branch-and-cut and branch-price-and-cut algorithms that find the exact optimal solutions for various vehicle routing problems (VRPs). Among various cuts, the rounded capacity…

In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already…

We study the fair capacitated vehicle routing problem, in which a fleet of vehicles must serve a set of customers such that the difference between the longest and shortest route, the range, is minimized. A key challenge is that the range…

In services such as retail audits and urban infrastructure monitoring, a platform dispatches rewarded, location-based micro-tasks to mobile workers traveling along personal origin-destination (OD) trips under hard time budgets. As requests…

Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based…

The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices are labeled as either mandatory or profitable, being the latter provided with rewards (profits). Given…

This paper introduces the correlated arc orienteering problem (CAOP), where the task is to find routes for a team of robots to maximize the collection of rewards associated with features in the environment. These features can be…