In this paper the capacitated team orienteering problem have been applied as a tool for carriers to avoid empty returns when trucks do not work with full load. The software based on bee colony optimization technique is developed for solving the problem. Numerical example is solved and the result is shown to depict the possibility of the proposed algorithm.

In recent years, the use of unmanned vehicles for monitoring spatial environmental phenomena has gained increasing attention. Within this context, an interesting problem is level set estimation, where the goal is to identify regions of space where the analyzed phenomena (for example the PH value in a body of water) is above or below a given threshold level. Typically, in the literature this pro...

In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and prizes (rewards) on nodes, and a start node s. In the Orienteering Problem, the goal is to find a path that maximizes the rewa...

<span>Over the last decade, many nature-inspired algorithms have been received considerable attention among practitioners and researchers to handle several optimization problems. Lion algorithm (LA) is inspired by a distinctive lifestyle of lions their collective behavior in social groups. LA has presented as powerful solve various In this paper, proposed investigate its performance solvi...

In many unmanned aerial vehicle (UAV) applications for surveillance and data collection, it is not possible to reach all requested locations due the given maximum flight time. Hence, must be prioritized problem of selecting most important modeled as an Orienteering Problem (OP). To fully exploit kinematic properties UAV in such scenarios, we combine OP with generation time-optimal trajectories ...