Major advances were recently obtained in the exact solution of vehicle routing problems
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …

This work proposes a learnheuristic approach (combination of heuristics with machine
learning) to solve an aerial-drone team orienteering problem. The goal is to maximise the …

Unmanned aerial vehicles (UAVs) are widely used for surveillance in both civilian and
military scenarios. The utilization of UAVs provides an opportunity for monitoring landslide …

Unmanned aerial vehicles (UAVs) have been extensively applied to goods delivery and in-
situ sensing. It becomes increasingly probable that multiple UAVs are delivering goods and …

Abstract The Team Orienteering Problem aims at maximizing the total amount of profit
collected by a fleet of vehicles while not exceeding a predefined travel time limit on each …

We study a new variant of the Team Orienteering Problem (TOP) where precedence
constraints are introduced. Each customer has a set of tasks that have to be accomplished …

Abstract The Team Orienteering Problem (TOP) is a well-known NP-Hard vehicle routing
problem in which one maximizes the collected profits for visiting some nodes. In this paper …

This paper puts forth a new application of an unmanned aerial vehicle (UAV) to joint goods
delivery and in-situ sensing, and proposes a new algorithm that jointly optimizes the route …

Online food delivery companies, nowadays, allow a customer to place an order for a
combination of dishes from one or more restaurants. To meet a customer's demand, the …

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 …